|
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.ConvexHullScanLinkedList
public class ConvexHullScanLinkedList
Computes Convex Hull following Andrew's Algorithm with linked lists. This is described
in the text.
This implementation of ConvexHull does not implement IConvexHull
because the
resulting double linked list computation would have to be converted to an array simply
to be returned. In doing so, the performance costs would be higher than they should be.
Constructor Summary | |
---|---|
ConvexHullScanLinkedList()
|
Method Summary | |
---|---|
DoubleLinkedList<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 ConvexHullScanLinkedList()
Method Detail |
---|
public DoubleLinkedList<IPoint> compute(IPoint[] points)
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 |