|
Algorithm Development Kit 1.0 |
||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Class Summary | |
---|---|
BucketAndrew | Computes Convex Hull following Andrew's Algorithm. |
Defines solution to the Convex Hull problem which uses BucketSort to sort the points prior to invoking Andrew's algorithm. We can use BucketSort even though the data set represents two dimensional points because Andrew's ConvexHullScan algorithm needs to order the points from left to right
|
Algorithm Development Kit 1.0 | ||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |