Add Min-Heap functionality to Binary Heap

The 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.

Id #13101 | Release: None | Updated: Feb 13, 2013 at 1:42 AM by jonlave | Created: Feb 27, 2011 at 5:37 AM by jonlave

Add Line Sweep Algorithm for Line Segment Intersections

Implement the line sweep algorithm for detecting line segment intersections.   Input: A set S of line segments. Output: All intersection points in S.   Don't use brute force search.

Id #13099 | Release: None | Updated: Feb 13, 2013 at 1:42 AM by jonlave | Created: Feb 27, 2011 at 5:30 AM by jonlave

AVL Tree

A balanced binary search tree, or AVL Tree, will be needed for an effecient line segment intersection algorithm.

Id #11512 | Release: None | Updated: Feb 13, 2013 at 1:42 AM by jonlave | Created: Jul 13, 2010 at 7:33 PM by jonlave

Create client app to demo library

A 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.

Id #11360 | Release: None | Updated: Feb 13, 2013 at 1:42 AM by jonlave | Created: Jul 1, 2010 at 10:33 PM by jonlave

  • 1-4 of 4 Work Items
    • Previous
    • 1
    • Next
    • Showing
    • All
    • Work Items