|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.stanford.rsl.konrad.geometry.ConvexHull
public class ConvexHull
super class for hull constructing algorithms Based on the gift wrapping code from Tim Lambert. Demo applets are presented here.
Constructor Summary | |
---|---|
ConvexHull(PointND[] pts)
|
Method Summary | |
---|---|
void |
build()
|
void |
build2D()
|
Triangle[] |
getFaces()
Returns the hull as an array of triangles |
PointND[] |
getHullPoints()
returns the hull as an array of Points |
PointND[] |
getRasterPoints(int number)
|
PointND[] |
intersect2D(StraightLine line)
Intersects lines between subsequent hull points. |
PointND[] |
intersect3D(StraightLine line)
|
boolean |
isInside(PointND point)
Tests whether the point is inside the convex hull. |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public ConvexHull(PointND[] pts)
Method Detail |
---|
public void build()
public void build2D()
public PointND[] getHullPoints()
public Triangle[] getFaces()
public boolean isInside(PointND point)
point
-
public PointND[] intersect2D(StraightLine line)
line
- the line to intersect with the hull
public PointND[] intersect3D(StraightLine line)
public PointND[] getRasterPoints(int number)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |