Class DTriangulationForJTS
java.lang.Object
org.openjump.core.graph.delauneySimplexInsert.DTriangulationForJTS
- Author:
- sstein Use the class to access the delauney trinagulation by L. Paul Chew Methods of the class are modified versions from DelaunayPanel.java in DelaunayAp.java.
-
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionDTriangulationForJTS(ArrayList pointList) DTriangulationForJTS(ArrayList pointList, org.locationtech.jts.geom.Envelope envelope) -
Method Summary
Modifier and TypeMethodDescriptionvoidaddPoint(double x, double y) voidDraw all the empty circles (one for each triangle) of the DT.Draw all the Delaunay edges.Draw all the sites (i.e., the input points) of the DT.Draw all the Voronoi edges.org.locationtech.jts.geom.Geometrythe size of the box has been empirically defined to get "undistorted" outer thiessen polygonsMethod returns thiessen polygons within a empirically enlarged bounding box around the point set.
-
Field Details
-
debug
public boolean debug
-
-
Constructor Details
-
DTriangulationForJTS
-
DTriangulationForJTS
- Parameters:
pointList- a list of Pointsenvelope- the envelope my extend the initial point cloud and result in a larger initial simplex
-
-
Method Details
-
addPoints
-
addPoint
public void addPoint(double x, double y) -
drawAllDelaunay
Draw all the Delaunay edges.- Returns:
- Arraylist with LineString geometries.
-
drawAllVoronoi
Draw all the Voronoi edges.- Returns:
- Arraylist with LineString geometries.
-
drawAllSites
Draw all the sites (i.e., the input points) of the DT.- Returns:
- Arraylist with point geometries.
-
drawAllCircles
Draw all the empty circles (one for each triangle) of the DT.- Returns:
- Arraylist with polygon geometries.
-
getDelaunayTriangulation
-
getInitialSimmplexAsJTSPoints
- Returns:
- the corner points of the initial simplex which is divided into smaller simplexes by the iterative insertion of the point dataset
-
getThiessenBoundingBox
public org.locationtech.jts.geom.Geometry getThiessenBoundingBox()the size of the box has been empirically defined to get "undistorted" outer thiessen polygons- Returns:
- a bounding box necesseray to create the final thiessenpolygons
-
getThiessenPolys
Method returns thiessen polygons within a empirically enlarged bounding box around the point set. Therefore the voronoi edges are polygonized and the intersecting voronoi polygons with the bounding box are calculated. These intersecting thiessen polygons (in the bounding box) are returned.Note: "thiesen" and "voronoi" is exchangeable.
- Returns:
- a list of Polygons
-