Uses of Class
org.locationtech.jts.triangulate.quadedge.Vertex
Packages that use Vertex
Package
Description
Classes to compute Delaunay triangulations.
Classes to implement a topological subdivision of quadeges, to support creating triangulations
and Voronoi diagrams.
-
Uses of Vertex in org.locationtech.jts.triangulate
Subclasses of Vertex in org.locationtech.jts.triangulateModifier and TypeClassDescriptionclassA vertex in a Constrained Delaunay Triangulation.Methods in org.locationtech.jts.triangulate with parameters of type VertexModifier and TypeMethodDescriptionIncrementalDelaunayTriangulator.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. -
Uses of Vertex in org.locationtech.jts.triangulate.quadedge
Methods in org.locationtech.jts.triangulate.quadedge that return VertexModifier and TypeMethodDescriptionVertex.circleCenter(Vertex b, Vertex c) Computes the centre of the circumcircle of this vertex and two others.final VertexQuadEdge.dest()Gets the vertex for the edge's destinationQuadEdgeTriangle.getVertex(int i) Vertex[]QuadEdgeTriangle.getVertices()Gets the vertices for this triangle.returns a new vertex that is mid-way between this vertex and another end point.final VertexQuadEdge.orig()Gets the vertex for the edge's originMethods in org.locationtech.jts.triangulate.quadedge with parameters of type VertexModifier and TypeMethodDescriptionVertex.circleCenter(Vertex b, Vertex c) Computes the centre of the circumcircle of this vertex and two others.doubleVertex.circumRadiusRatio(Vertex b, Vertex c) Computes the value of the ratio of the circumradius to shortest edge.intstatic booleanQuadEdgeTriangle.contains(Vertex[] tri, Coordinate pt) Tests whether the point pt is contained in the triangle defined by 3Vertexes.booleanbooleanintQuadEdgeTriangle.getEdgeIndex(Vertex v) Gets the index for the edge that starts at vertex v.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).doubleVertex.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.final booleanTests whether the triangle formed by this vertex and two other vertices is in CCW orientation.booleanQuadEdgeSubdivision.isFrameVertex(Vertex v) Tests whether a vertex is a vertex of the outer triangle.booleanVertex.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).booleanQuadEdgeSubdivision.isVertexOfEdge(QuadEdge e, Vertex v) Locates an edge e, such that either v is on e, or e is an edge of a triangle containing v.Finds a quadedge of a triangle containing a location specified by aVertex, if one exists.QuadEdgeSubdivision.locateFromEdge(Vertex v, QuadEdge startEdge) Locates an edge of a triangle which contains a location specified by a Vertex v.static QuadEdgeCreates a new quadedge, recording it in the edges list.returns a new vertex that is mid-way between this vertex and another end point.static Geometry