|
Algorithm Development Kit 1.0 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface IConvexHull
Defined interface for algorithms that compute the convex hull for a set of IPoint objects.
Method Summary | |
---|---|
IPoint[] |
compute(IPoint[] points)
Return the computed convex hull for the input set of IPoint objects. |
Method Detail |
---|
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".
Some implementations may be able to work if duplicate points are found,
but the set should contain distinct IPoint
objects.
points
- an array 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 |