|
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.heap.HeapAndrew
public class HeapAndrew
Computes Convex Hull following Andrew's Algorithm. This is described in the text. Uses a BinaryHeap as the sorting entity for the points.
| Constructor Summary | |
|---|---|
HeapAndrew()
|
|
| 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 HeapAndrew()
| Method Detail |
|---|
public IPoint[] compute(IPoint[] points)
compute in interface IConvexHullpoints - 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 | ||||||||