|
Algorithm Development Kit 1.0 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectalgs.model.problems.convexhull.andrew.ConvexHullScan
public class ConvexHullScan
Computes Convex Hull following Andrew's Algorithm. This algorithm is described in the text.
Constructor Summary | |
---|---|
ConvexHullScan()
|
Method Summary | |
---|---|
IPoint[] |
compute(IPoint[] points)
Use Andrew's algorithm to return the computed convex hull for the input set of points. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public ConvexHullScan()
Method Detail |
---|
public IPoint[] compute(IPoint[] points)
Points must have at least three points to do anything meaningful. If it does not, then the sorted array is returned as the "hull".
This algorithm will still work if duplicate points are found in the input set of points.
compute
in interface IConvexHull
points
- a set of (n ≥ 3) two dimensional points.
|
Algorithm Development Kit 1.0 | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |