Computational Geometryhttp://compgeo.codeplex.com/project/feeds/rssA library of Computational Geometry algorithms such as convex hulls, Voronoi diagrams, line intersections, triangulations, and more; written in C#.Source code checked in, #96133http://compgeo.codeplex.com/SourceControl/changeset/changes/96133Upgrade: New Version of LabDefaultTemplate.xaml. To upgrade your build definitions, please visit the following link: http://go.microsoft.com/fwlink/?LinkId=254563Project Collection Service AccountsMon, 01 Oct 2012 21:40:31 GMTSource code checked in, #96133 20121001094031PSource code checked in, #96132http://compgeo.codeplex.com/SourceControl/changeset/changes/96132Checked in by server upgradeProject Collection Service AccountsMon, 01 Oct 2012 21:33:03 GMTSource code checked in, #96132 20121001093303PUpdated Wiki: Homehttp://compgeo.codeplex.com/wikipage?version=3<div class="wikidoc">
<p><strong>Project Description</strong><br>
A library of Computational Geometry algorithms such as convex hulls, Voronoi diagrams, line intersections, triangulations, and more; written in C#.</p>
<p><strong>Features:</strong></p>
<ul>
<li>Convex Hull 2D algorithm </li><li>Basic shape library (point, line, polygon) </li><li>Data Structures
<ul>
<li>Binary Tree </li><li>Binary Heap (Max, Min planned) </li></ul>
</li></ul>
<p><strong>Planned:</strong></p>
<ul>
<li>Algorithms
<ul>
<li>Line sweep algorithm for detecting line segment intersections </li><li>Map overlays </li><li>Voronoi diagram </li><li>Delaunay triangulations </li><li>and more. </li></ul>
</li></ul>
</div><div class="ClearBoth"></div>jonlaveSun, 27 Feb 2011 06:53:16 GMTUpdated Wiki: Home 20110227065316ACreated 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] 20110227062218ASource code checked in, #73791http://compgeo.codeplex.com/SourceControl/changeset/changes/73791Added binary heap data structure with simple unit tests.jonlaveSun, 27 Feb 2011 06:22:18 GMTSource code checked in, #73791 20110227062218ASource code checked in, #64218http://compgeo.codeplex.com/SourceControl/changeset/changes/64218Code cleanup. Added Polygon class.jonlaveThu, 05 Aug 2010 01:40:20 GMTSource code checked in, #64218 20100805014020ASource code checked in, #63489http://compgeo.codeplex.com/SourceControl/changeset/changes/63489Checked in by server upgrade_TFSSERVICETue, 27 Jul 2010 20:28:19 GMTSource code checked in, #63489 20100727082819PCreated 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] 20100720025728ASource code checked in, #62980http://compgeo.codeplex.com/SourceControl/changeset/changes/62980Added a generic binary search tree with unit tests.jonlaveTue, 20 Jul 2010 02:57:28 GMTSource code checked in, #62980 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] 20100713073317PSource code checked in, #62436http://compgeo.codeplex.com/SourceControl/changeset/changes/62436Adding changes that didn't make it in last checkin.jonlaveSat, 10 Jul 2010 22:15:02 GMTSource code checked in, #62436 20100710101502PClosed 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] 20100710101329PSource code checked in, #62435http://compgeo.codeplex.com/SourceControl/changeset/changes/62435Adding NUnit framework and unit test project for library unit tests. Added unit tests for Convex Hull 2D algorithm, and other basic functions.jonlaveSat, 10 Jul 2010 22:13:29 GMTSource code checked in, #62435 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] 20100701102703P