|
Algorithm Development Kit 1.0 |
||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||
See:
Description
| Class Summary | |
|---|---|
| SlowHull | Computes Convex Hull using a brute force approach that computes all n^3 triangles and removes points that are within a triangle. |
Defines solution to the Convex Hull problem that relies on a Brute Force n^4 algorithm to check each potential triangle and removes points that fall within the triangle. Provided as "straw man" implementation to show the efficiency of ConvexHullScan.
|
Algorithm Development Kit 1.0 | ||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||