Package | Description |
---|---|
org.locationtech.jts.triangulate |
Classes to compute Delaunay triangulations.
|
org.locationtech.jts.triangulate.quadedge |
Classes to implement a topological subdivision of quadeges, to support creating triangulations
and Voronoi diagrams.
|
Modifier and Type | Class and Description |
---|---|
class |
ConstraintVertex
A vertex in a Constrained Delaunay Triangulation.
|
Modifier and Type | Method and Description |
---|---|
QuadEdge |
IncrementalDelaunayTriangulator.insertSite(Vertex v)
Inserts a new point into a subdivision representing a Delaunay
triangulation, and fixes the affected edges so that the result is still a
Delaunay triangulation.
|
Modifier and Type | Method and Description |
---|---|
Vertex |
Vertex.circleCenter(Vertex b,
Vertex c)
Computes the centre of the circumcircle of this vertex and two others.
|
Vertex |
QuadEdge.dest()
Gets the vertex for the edge's destination
|
Vertex |
QuadEdgeTriangle.getVertex(int i) |
Vertex[] |
QuadEdgeTriangle.getVertices()
Gets the vertices for this triangle.
|
Vertex |
Vertex.midPoint(Vertex a)
returns a new vertex that is mid-way between this vertex and another end point.
|
Vertex |
QuadEdge.orig()
Gets the vertex for the edge's origin
|
Modifier and Type | Method and Description |
---|---|
Vertex |
Vertex.circleCenter(Vertex b,
Vertex c)
Computes the centre of the circumcircle of this vertex and two others.
|
double |
Vertex.circumRadiusRatio(Vertex b,
Vertex c)
Computes the value of the ratio of the circumradius to shortest edge.
|
int |
Vertex.classify(Vertex p0,
Vertex p1) |
static boolean |
QuadEdgeTriangle.contains(Vertex[] tri,
Coordinate pt)
Tests whether the point pt is contained in the triangle defined by 3
Vertex es. |
boolean |
Vertex.equals(Vertex _x) |
boolean |
Vertex.equals(Vertex _x,
double tolerance) |
int |
QuadEdgeTriangle.getEdgeIndex(Vertex v)
Gets the index for the edge that starts at vertex v.
|
QuadEdge |
QuadEdgeSubdivision.insertSite(Vertex v)
Inserts a new site into the Subdivision, connecting it to the vertices of
the containing triangle (or quadrilateral, if the split point falls on an
existing edge).
|
double |
Vertex.interpolateZValue(Vertex v0,
Vertex v1,
Vertex v2)
For this vertex enclosed in a triangle defined by three vertices v0, v1 and v2, interpolate
a z value from the surrounding vertices.
|
boolean |
Vertex.isCCW(Vertex b,
Vertex c)
Tests whether the triangle formed by this vertex and two
other vertices is in CCW orientation.
|
boolean |
QuadEdgeSubdivision.isFrameVertex(Vertex v)
Tests whether a vertex is a vertex of the outer triangle.
|
boolean |
Vertex.isInCircle(Vertex a,
Vertex b,
Vertex c)
Tests if the vertex is inside the circle defined by
the triangle with vertices a, b, c (oriented counter-clockwise).
|
boolean |
QuadEdgeSubdivision.isVertexOfEdge(QuadEdge e,
Vertex v)
|
QuadEdge |
QuadEdgeSubdivision.locate(Vertex v)
Finds a quadedge of a triangle containing a location
specified by a
Vertex , if one exists. |
QuadEdge |
LastFoundQuadEdgeLocator.locate(Vertex v)
Locates an edge e, such that either v is on e, or e is an edge of a triangle containing v.
|
QuadEdge |
QuadEdgeLocator.locate(Vertex v) |
QuadEdge |
QuadEdgeSubdivision.locateFromEdge(Vertex v,
QuadEdge startEdge)
Locates an edge of a triangle which contains a location
specified by a Vertex v.
|
QuadEdge |
QuadEdgeSubdivision.makeEdge(Vertex o,
Vertex d)
Creates a new quadedge, recording it in the edges list.
|
static QuadEdge |
QuadEdge.makeEdge(Vertex o,
Vertex d)
|
Vertex |
Vertex.midPoint(Vertex a)
returns a new vertex that is mid-way between this vertex and another end point.
|
static Geometry |
QuadEdgeTriangle.toPolygon(Vertex[] v) |
Copyright © 2022. All rights reserved.