|
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.AklToussaint
public class AklToussaint
Heuristic that offers noticeable speed-up when when applied to Convex Hull problems. Questions that may not have an impact but are worth asking: What if LEFT/BOTTOM are same point and TOP/RIGHT are same point? What if LEFT/BOTTOM/TOP/RIGHT are all same point?
Method Summary | |
---|---|
static IPoint[] |
reduce(IPoint[] points)
Remove points that are within the quadrilateral formed by the extreme points at (x,y) axes. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Method Detail |
---|
public static IPoint[] reduce(IPoint[] points)
These points clearly cannot be on the convex hull. The array returned contains those points that are outside the quadrilateral.
points
- initial convex hull set.
|
Algorithm Development Kit 1.0 | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |