compgeo Issue Tracker Rss Feedhttp://compgeo.codeplex.com/workitem/list/basiccompgeo Issue Tracker Rss DescriptionCreated Issue: Add Min-Heap functionality to Binary Heap [13101]http://compgeo.codeplex.com/workitem/13101The current BinaryHeap class acts as a Max-Heap, but can be used as a Min-Heap if a few extra functions were added to support it.<br />jonlaveSun, 27 Feb 2011 06:37:52 GMTCreated Issue: Add Min-Heap functionality to Binary Heap [13101] 20110227063752ACreated Feature: Add Line Sweep Algorithm for Line Segment Intersections [13099]http://compgeo.codeplex.com/workitem/13099Implement the line sweep algorithm for detecting line segment intersections.<br /><br />Input: A set S of line segments.<br />Output: All intersection points in S.<br /><br />Don't use brute force search.<br />jonlaveSun, 27 Feb 2011 06:30:29 GMTCreated Feature: Add Line Sweep Algorithm for Line Segment Intersections [13099] 20110227063029AClosed Feature: Create a binary heap [11605]http://compgeo.codeplex.com/workitem/11605A binary heap data structure will be needed as a priority queue for line sweep algorithm.<br />Comments: Resolved with changeset 73791.jonlaveSun, 27 Feb 2011 06:22:18 GMTClosed Feature: Create a binary heap [11605] 20110227062218ACreated Feature: Create a binary heap [11605]http://compgeo.codeplex.com/workitem/11605A binary heap data structure will be needed as a priority queue for line sweep algorithm.<br />jonlaveTue, 20 Jul 2010 18:38:09 GMTCreated Feature: Create a binary heap [11605] 20100720063809PClosed Feature: Add generic Binary Tree data structure [11361]http://compgeo.codeplex.com/workitem/11361A binary tree collection will be needed for line intersection algorithm.<br />Comments: Resolved with changeset 62980.jonlaveTue, 20 Jul 2010 02:57:28 GMTClosed Feature: Add generic Binary Tree data structure [11361] 20100720025728ACreated Feature: AVL Tree [11512]http://compgeo.codeplex.com/workitem/11512A balanced binary search tree, or AVL Tree, will be needed for an effecient line segment intersection algorithm.<br />jonlaveTue, 13 Jul 2010 19:33:17 GMTCreated Feature: AVL Tree [11512] 20100713073317PClosed Task: Add unit tests for Convex Hull 2D algorithm [11357]http://compgeo.codeplex.com/workitem/11357Unit tests for Convex Hull 2D algorithm are needed.<br />jonlaveSat, 10 Jul 2010 22:13:29 GMTClosed Task: Add unit tests for Convex Hull 2D algorithm [11357] 20100710101329PCreated Feature: Add generic Binary Tree data structure [11361]http://compgeo.codeplex.com/workitem/11361A binary tree collection will be needed for line intersection algorithm.<br />jonlaveThu, 01 Jul 2010 22:35:48 GMTCreated Feature: Add generic Binary Tree data structure [11361] 20100701103548PCreated Feature: Create client app to demo library [11360]http://compgeo.codeplex.com/workitem/11360A client application (WPF or console) is needed to demonstrate the algorithms in the library. A quick console app could be made first with a richer, WPF one created later.<br />jonlaveThu, 01 Jul 2010 22:33:15 GMTCreated Feature: Create client app to demo library [11360] 20100701103315PCreated Task: Add unit tests for Convex Hull 2D algorithm [11357]http://compgeo.codeplex.com/workitem/11357Unit tests for Convex Hull 2D algorithm are needed.<br />jonlaveThu, 01 Jul 2010 22:29:08 GMTCreated Task: Add unit tests for Convex Hull 2D algorithm [11357] 20100701102908PClosed Feature: Convex Hull 2D algorithm [11268]http://compgeo.codeplex.com/workitem/11268The Convex Hull 2D algorithm needs to be implemented as the initial algorithm to the library.<br />Comments: <p>Work item finished with changeset 61028.</p>jonlaveThu, 01 Jul 2010 22:27:03 GMTClosed Feature: Convex Hull 2D algorithm [11268] 20100701102703PCreated Feature: Convex Hull 2D algorithm [11268]http://compgeo.codeplex.com/workitem/11268The Convex Hull 2D algorithm needs to be implemented as the initial algorithm to the library.<br />jonlaveMon, 28 Jun 2010 05:42:07 GMTCreated Feature: Convex Hull 2D algorithm [11268] 20100628054207A