Convex Hull: The "QuickHull" Algorithm
fast, like QuickSort
The "QuickHull" algorithm is so named because of its similarity to the QuickSort algorithm. The algorithm is recursive, and, at each step of the algorithm, points are identified which are internal, and therefore never again are needed for the vertices of the convex hull.
This work was done, wholly or in part, by Kevin R. Camasi, F&M'01, and Anne Fairchild Peacock, F&M '02.
The algorithm is order O(n log n). It proceeds by finding the bottommost, topmost, leftmost and rightmost points in the set. These must lie on the convex hull. A quadrilateral is drawn with these four points as its vertices. Then, each edge is examined to see if point like outside the edge. The point which lies furthest outside the edge must like on the convex hull; therefore the original edge is removed, and new edges to the new exterior point are added. This process is repeated recursively for each of the four edges of the original quadrilateral.
This work was done, wholly or in part, by Anne Fairchild Peacock, F&M '02, and Kevin R. Camasi, F&M '01.
Remember the guidelines for the use of these movies.
Eight movies are available: two each for 10, 25, 50, and 100 points. One of the 50-point movies includes pauses at which questions for the viewer are posed.
|
|
|
|
|
|
