Package | Description |
---|---|
org.tinfour.common |
Provides classes and interfaces that are common to multiple
packages within the TinFour project.
|
org.tinfour.edge |
Provides implementations of the IQuadEdge interface with supporting
data-management classes.
|
org.tinfour.interpolation |
Provides interfaces and supporting classes for performing
interpolation over TINs
|
org.tinfour.semivirtual |
Provides classes and interfaces for creating a Triangulated Irregular
Network (TIN) based on the Delaunay Triangulation specification
and using a semi-virtual representation of edges to reduce memory
requirements.
|
org.tinfour.standard |
Provides classes and interfaces for creating a Triangulated Irregular
Network (TIN) based on the Delaunay Triangulation specification.
|
org.tinfour.utils |
Provides both high-level and general utilities for using the Tinfour packages.
|
org.tinfour.utils.loaders |
Defines interfaces and provides utilities for loading data
|
org.tinfour.voronoi |
An experimental package implementing Voronoi Diagram functionality
|
Modifier and Type | Class and Description |
---|---|
class |
VertexAdjustment
Provides a wrapper class used to represent the adjusted position
of a vertex.
|
class |
VertexMergerGroup
A synthetic vertex used to handle cases when multiple vertices
occupy coincident locations.
|
Modifier and Type | Field and Description |
---|---|
protected List<Vertex> |
PolyLineConstraintAdapter.list |
Modifier and Type | Method and Description |
---|---|
Vertex[] |
BootstrapUtility.bootstrap(List<Vertex> list)
Obtain the initial three vertices for building the mesh by selecting from
the input list.
|
Vertex |
IQuadEdge.getA()
Gets the initial vertex for this edge.
|
Vertex |
IQuadEdge.getB()
Gets the second vertex for this edge.
|
Vertex |
NeighborEdgeVertex.getNearestVertex()
Gets the vertex nearest the query point.
|
Vertex |
NearestEdgeResult.getNearestVertex()
Gets the vertex nearest the query point.
|
Vertex |
IIncrementalTinNavigator.getNearestVertex(double x,
double y)
Gets the nearest vertex to the specified coordinates
|
Vertex |
VertexAdjustment.getVertex()
Gets the original vertex that was used to produce this instance
|
Vertex |
SimpleTriangle.getVertexA()
Gets vertex A of the triangle.
|
Vertex |
SimpleTriangle.getVertexB()
Gets vertex B of the triangle.
|
Vertex |
SimpleTriangle.getVertexC()
Gets vertex A of the triangle.
|
Vertex[] |
VertexMergerGroup.getVertices()
Gets an array of the coincident vertices.
|
Vertex |
VertexIterator.next() |
Vertex |
IIncrementalTin.splitEdge(IQuadEdge eInput,
double zSplit,
boolean restoreConformity)
Split an existing edge into two at the midpoint, using the
specified zSplit value as the z coordinate for the edge.
|
Modifier and Type | Method and Description |
---|---|
List<Vertex> |
INeighborhoodPointsCollector.collectNeighboringVertices(double x,
double y,
int searchDepth,
int targetMinVertexCount)
Gets the points in the neighborhood of a pair of query coordinates.
|
List<Vertex> |
PolyLineConstraintAdapter.getVertices() |
List<Vertex> |
PolygonConstraint.getVertices() |
List<Vertex> |
IPolyline.getVertices()
Gets the vertices for this feature.
|
List<Vertex> |
IIncrementalTin.getVertices()
Gets a list of vertices currently stored in the TIN.
|
Iterator<Vertex> |
PolyLineConstraintAdapter.iterator() |
Iterable<Vertex> |
IIncrementalTin.vertices()
Provides a convenience implementation
that can be used with a Java enhanced-loop statement to access the set
of vertices stored in an incremental TIN.
|
Modifier and Type | Method and Description |
---|---|
void |
PolyLineConstraintAdapter.add(Vertex v) |
void |
IPolyline.add(Vertex v)
Adds a vertex to the polyline feature.
|
boolean |
IIncrementalTin.add(Vertex v)
Insert a vertex into the collection of vertices managed by
the TIN.
|
boolean |
VertexMergerGroup.addVertex(Vertex v)
Add a new vertex to the coincident collection.
|
double |
GeometricOperations.area(Vertex a,
Vertex b,
Vertex c)
Determines the signed area of triangle ABC.
|
boolean |
GeometricOperations.circumcircle(Vertex a,
Vertex b,
Vertex c,
Circumcircle result)
Computes the circumcircle for the coordinates of three vertices.
|
boolean |
Circumcircle.compute(Vertex a,
Vertex b,
Vertex c)
Computes the circumcircle for the specified vertices and stores
results in elements of this instance.
|
static Circumcircle |
Circumcircle.computeCircumcircle(Vertex a,
Vertex b,
Vertex c)
Computes the circumcircle for the specified vertices.
|
boolean |
VertexMergerGroup.contains(Vertex v)
Indicates whether the group contains the specified vertex
|
double |
Vertex.getDistance(Vertex v)
Get the distance to the vertex.
|
double |
Vertex.getDistanceSq(Vertex v)
Get the square of the distance to the vertex.
|
double |
GeometricOperations.inCircle(Vertex a,
Vertex b,
Vertex c,
Vertex d)
Determines if vertex d lies within the circumcircle of triangle a,b,c,
using extended-precision arithmetic when required by small
magnitude results.
|
boolean |
IIncrementalTin.remove(Vertex vRemove)
Removes the specified vertex from the TIN.
|
boolean |
VertexMergerGroup.removeVertex(Vertex v)
Removes the specified vertex from the group.
|
void |
TriangleCount.tabulateTriangle(Vertex vA,
Vertex vB,
Vertex vC)
Compute area for the triangle specified by the vertex arguments and
add it to the triangle count and area summations.
|
Modifier and Type | Method and Description |
---|---|
boolean |
IIncrementalTin.add(List<Vertex> list,
IMonitorWithCancellation monitor)
Inserts a list of vertices into the collection of vertices managed by the
TIN.
|
Vertex[] |
BootstrapUtility.bootstrap(List<Vertex> list)
Obtain the initial three vertices for building the mesh by selecting from
the input list.
|
PolygonConstraint |
PolygonConstraint.getConstraintWithNewGeometry(List<Vertex> geometry) |
LinearConstraint |
LinearConstraint.getConstraintWithNewGeometry(List<Vertex> geometry) |
IConstraint |
IConstraint.getConstraintWithNewGeometry(List<Vertex> geometry)
Gets a new constraint that has the attributes of this constraint
and the specified geometry.
|
PolygonConstraint |
PolygonConstraint.refactor(Iterable<Vertex> geometry) |
LinearConstraint |
LinearConstraint.refactor(Iterable<Vertex> geometry) |
IPolyline |
IPolyline.refactor(Iterable<Vertex> geometry)
Creates a new polyline feature with the specified geometry
and transfers any data elements defined by the implementing class
from the current object to the newly created one.
|
boolean |
IIntegrityCheck.testGetVerticesAgainstInputList(List<Vertex> inputList)
Compares the list of vertices from the getVertices() method
to the original list of input vertices and determines whether they
are consistent.
|
BootstrapUtility.BootstrapTestResult |
BootstrapUtility.testInput(List<Vertex> input,
List<Vertex> output)
Given a set of input Vertices, test to see if their (x,y) coordinates are
sufficient to create a bootstrap triangle for processing.
|
BootstrapUtility.BootstrapTestResult |
BootstrapUtility.testInput(List<Vertex> input,
List<Vertex> output)
Given a set of input Vertices, test to see if their (x,y) coordinates are
sufficient to create a bootstrap triangle for processing.
|
Constructor and Description |
---|
LinearConstraint(Vertex v0,
Vertex v1)
A convience constructor intended for the frequently occurring case
in which an application wishes to define a constraint as a single
line segment.
|
PolygonConstraint(Vertex v0,
Vertex v1,
Vertex v2,
Vertex v3)
A convenience constructor intended for the frequently occurring case
in which an application wishes to define a constraint as a rectangle
or four-vertex polygon
|
VertexAdjustment(double x,
double y,
Vertex vertex)
Construct an instance with the specified Cartesian coordinates
while copying the attributes of the original vertex.
|
VertexMergerGroup(Vertex firstVertex)
Constructs a coincident vertex using the specified vertex
for initialization.
|
Constructor and Description |
---|
LinearConstraint(List<Vertex> vList)
Constructs a constraint with the specified vertices.
|
PolygonConstraint(List<Vertex> vList)
Constructs a constraint with the specified vertices.
|
Modifier and Type | Method and Description |
---|---|
Vertex |
QuadEdge.getA()
Gets the initial vertex for this edge.
|
Vertex |
QuadEdge.getB()
Gets the second vertex for this edge.
|
Modifier and Type | Method and Description |
---|---|
QuadEdge |
EdgePool.allocateEdge(Vertex a,
Vertex b) |
void |
QuadEdge.setA(Vertex a)
Sets the initial vertex for this edge.
|
void |
QuadEdge.setB(Vertex b)
Sets the second (B) vertex for this edge (also the A reference of
the dual edge).
|
void |
QuadEdge.setVertices(Vertex a,
Vertex b)
Sets the vertices for this edge (and its dual).
|
QuadEdge |
EdgePool.splitEdge(QuadEdge e,
Vertex m)
Split the edge e into two by inserting a new vertex m into
the edge.
|
Modifier and Type | Method and Description |
---|---|
double |
VertexValuatorDefault.value(Vertex v) |
double |
IVertexValuator.value(Vertex v)
Given a vertex v, obtain its value
|
Modifier and Type | Method and Description |
---|---|
Vertex |
SemiVirtualEdge.getA() |
Vertex |
SemiVirtualEdge.getB() |
Vertex |
SemiVirtualEdge.getTriangleApex()
When the edge exists within a TIN, this method gets the apex of a triangle
formed with the edge as the base.
|
Vertex |
SemiVirtualIncrementalTin.splitEdge(IQuadEdge eInput,
double zSplit,
boolean restoreConformity) |
Modifier and Type | Method and Description |
---|---|
List<Vertex> |
SemiVirtualIncrementalTin.getVertices()
Gets a list of vertices currently stored in the TIN.
|
Iterable<Vertex> |
SemiVirtualIncrementalTin.vertices() |
Modifier and Type | Method and Description |
---|---|
boolean |
SemiVirtualIncrementalTin.add(Vertex v)
Insert a vertex into the collection of vertices managed by
the TIN.
|
boolean |
SemiVirtualIncrementalTin.remove(Vertex vRemove)
Removes the specified vertex from the TIN.
|
void |
SemiVirtualEdge.setA(Vertex a)
Sets the initial vertex of the current edge (and final vertex of its dual)
|
void |
SemiVirtualEdge.setB(Vertex b)
Sets the final vertex of the current edge (and initial vertex of its dual)
|
void |
SemiVirtualEdge.setVertices(Vertex a,
Vertex b)
Sets both vertices for the current edge (and the opposite vertices of its
dual).
|
Modifier and Type | Method and Description |
---|---|
boolean |
SemiVirtualIncrementalTin.add(List<Vertex> list,
IMonitorWithCancellation monitor)
Inserts a list of vertices into the collection of vertices managed by the
TIN.
|
Modifier and Type | Method and Description |
---|---|
Vertex |
IncrementalTin.splitEdge(IQuadEdge eInput,
double zSplit,
boolean restoreConformity) |
Modifier and Type | Method and Description |
---|---|
List<Vertex> |
IncrementalTin.getVertices()
Gets a list of vertices currently stored in the TIN.
|
Iterable<Vertex> |
IncrementalTin.vertices() |
Modifier and Type | Method and Description |
---|---|
boolean |
IncrementalTin.add(Vertex v)
Insert a vertex into the collection of vertices managed by the TIN.
|
boolean |
IncrementalTin.remove(Vertex vRemove)
Removes the specified vertex from the TIN.
|
Modifier and Type | Method and Description |
---|---|
boolean |
IncrementalTin.add(List<Vertex> list,
IMonitorWithCancellation monitor)
Inserts a list of vertices into the collection of vertices managed by the
TIN.
|
boolean |
IntegrityCheck.testGetVerticesAgainstInputList(List<Vertex> inputList) |
Modifier and Type | Method and Description |
---|---|
List<Vertex> |
SmoothingFilterInitializer.getConnectedPolygon(IQuadEdge e)
Gets a polygon consisting of edges connected to
the specified edge (in effect providing the set of vertices
connected to the starting vertex of the specified edge).
|
List<Vertex> |
NearestNeighborPointCollector.getVertices()
Gets a list of the vertices currently stored in the collection.
|
Modifier and Type | Method and Description |
---|---|
int |
NearestNeighborPointCollector.getNearestNeighbors(double x,
double y,
int k,
double[] d,
Vertex[] v)
Get the K nearest neighbors from the collection.
|
double |
SmoothingFilter.value(Vertex v) |
Modifier and Type | Method and Description |
---|---|
double[] |
BarycentricCoordinates.getBarycentricCoordinates(List<Vertex> polygon,
double x,
double y)
Given a reference point inside a simple, but potentially non-convex
polygon, creates an array of barycentric coordinates for the point.
|
boolean |
HilbertSort.sort(List<Vertex> vertexList)
Sort the vertices in the list by their Hilbert ranking.
|
Constructor and Description |
---|
NearestNeighborPointCollector(List<Vertex> vList,
boolean mergeDuplicates)
Construct a collector based on the specified list of vertices and
bounds.
|
Modifier and Type | Method and Description |
---|---|
List<Vertex> |
VertexReaderText.read(IMonitorWithCancellation monitor) |
List<Vertex> |
IVertexReader.read(IMonitorWithCancellation monitor)
Read a collection of vertices from the data source associated
with the current implementation and instance.
|
Modifier and Type | Method and Description |
---|---|
Vertex |
ThiessenPolygon.getVertex()
Gets the defining vertex of the polygon.
|
Modifier and Type | Method and Description |
---|---|
List<Vertex> |
BoundedVoronoiDiagram.getVertices()
Gets a list of the vertices that define the Voronoi Diagram.
|
List<Vertex> |
BoundedVoronoiDiagram.getVoronoiVertices()
Gets the vertices that were created to produce the Voronoi Diagram.
|
Modifier and Type | Method and Description |
---|---|
void |
BoundedVoronoiDrawingUtility.drawVertices(Graphics g,
Color foreground,
Font font,
List<Vertex> vertexList)
Draws a the vertices of the specified list.
|
Constructor and Description |
---|
ThiessenPolygon(Vertex vertex,
List<IQuadEdge> edgeList,
boolean open)
Constructs a Thiessen Polygon representation.
|
Constructor and Description |
---|
BoundedVoronoiDiagram(List<Vertex> vertexList,
BoundedVoronoiBuildOptions options)
Construct a Voronoi Diagram structure based on the input vertex set.
|
Copyright © 2021. All rights reserved.