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.voronoi |
An experimental package implementing Voronoi Diagram functionality
|
Modifier and Type | Field and Description |
---|---|
protected IQuadEdge |
PolyLineConstraintAdapter.constraintLinkingEdge |
Modifier and Type | Method and Description |
---|---|
IQuadEdge |
IQuadEdge.getBaseReference()
Gets the reference to the side-zero edge of the pair.
|
IQuadEdge |
PolyLineConstraintAdapter.getConstraintLinkingEdge() |
IQuadEdge |
IConstraint.getConstraintLinkingEdge() |
IQuadEdge |
IQuadEdge.getDual()
Gets the dual edge to this instance.
|
IQuadEdge |
IQuadEdge.getDualFromReverse()
Gets the dual of the reverse reference of the edge.
|
IQuadEdge |
NeighborEdgeVertex.getEdge()
Gets the edge that begins with the vertex closest to the query
coordinates.
|
IQuadEdge |
NearestEdgeResult.getEdge()
Gets the edge that is nearest to the query point.
|
IQuadEdge |
SimpleTriangle.getEdgeA()
Get edge a from the triangle
|
IQuadEdge |
SimpleTriangle.getEdgeB()
Get edge b from the triangle
|
IQuadEdge |
SimpleTriangle.getEdgeC()
Get edge c from the triangle
|
IQuadEdge |
IQuadEdge.getForward()
Gets the forward reference of the edge.
|
IQuadEdge |
IQuadEdge.getForwardFromDual()
Gets the forward reference of the dual.
|
IQuadEdge |
INeighborEdgeLocator.getNeigborEdge(double x,
double y)
Gets a neighboring edge for the coordinates.
|
IQuadEdge |
IIncrementalTinNavigator.getNeighborEdge(double x,
double y)
Gets a neighboring edge for the coordinates.
|
IQuadEdge |
IQuadEdge.getReverse()
Gets the reverse reference of the edge.
|
IQuadEdge |
IQuadEdge.getReverseFromDual()
Gets the reverse link of the dual.
|
Modifier and Type | Method and Description |
---|---|
Iterable<IQuadEdge> |
IIncrementalTin.edges()
Provides a convenience implementation
that can be used with a Java enhanced-loop statement to access the set
of edges that form the structure of the incremental TIN.
|
Iterator<IQuadEdge> |
IIncrementalTin.getEdgeIterator()
Gets an iterator for stepping through the collection of edges
currently stored in the TIN.
|
List<IQuadEdge> |
IIncrementalTin.getEdges()
Gets a list of edges currently allocated by an instance.
|
List<IQuadEdge> |
IIncrementalTin.getPerimeter()
Gets a list of edges currently defining the perimeter of the TIN.
|
Iterable<IQuadEdge> |
IQuadEdge.pinwheel()
Gets an instance of an iterable that performs a pinwheel operation.
|
Modifier and Type | Method and Description |
---|---|
IConstraint |
IIncrementalTin.getLinearConstraint(IQuadEdge edge)
Gets the linear constraint associated with the edge, if any.
|
IConstraint |
IIncrementalTin.getRegionConstraint(IQuadEdge edge)
Gets the region constraint associated with the edge, if any.
|
void |
PolyLineConstraintAdapter.setConstraintLinkingEdge(IQuadEdge edge) |
void |
IConstraint.setConstraintLinkingEdge(IQuadEdge linkingEdge)
Sets a reference to an arbitrarily selected edge that was produced
when the constraint was added to a TIN.
|
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.
|
Constructor and Description |
---|
NearestEdgeResult(IQuadEdge edge,
double edgeD,
double queryX,
double queryY,
boolean interior)
Standard constructor.
|
NeighborEdgeVertex(IQuadEdge edge,
double d,
double x,
double y,
boolean interior)
Standard constructor.
|
SimpleTriangle(IIncrementalTin tin,
IQuadEdge a)
Construct a simple triangle from the specified edges.
|
SimpleTriangle(IIncrementalTin tin,
IQuadEdge a,
IQuadEdge b,
IQuadEdge c)
Construct a simple triangle from the specified edges.
|
Modifier and Type | Class and Description |
---|---|
class |
QuadEdge
A representation of an edge with forward and reverse links on one
side and counterpart links attached to its dual (other side).
|
Modifier and Type | Method and Description |
---|---|
IQuadEdge |
QuadEdgePinwheel.next() |
Modifier and Type | Method and Description |
---|---|
List<IQuadEdge> |
EdgePool.getEdges()
Get a list of the Edges currently stored in the collection
|
Iterator<IQuadEdge> |
EdgePool.getIterator(boolean includeGhostEdges)
Constructs an iterator that will optionally skip
ghost edges.
|
Iterator<IQuadEdge> |
QuadEdgePinwheel.iterator() |
Iterator<IQuadEdge> |
EdgePool.iterator() |
Iterable<IQuadEdge> |
QuadEdge.pinwheel() |
Modifier and Type | Method and Description |
---|---|
void |
EdgePool.addBorderConstraintToMap(IQuadEdge edge,
IConstraint constraint)
Adds the specified constraint to the border constraint map, thus recording
which region constraint lies to the left side of the edge (e.g.
|
void |
EdgePool.addLinearConstraintToMap(IQuadEdge edge,
IConstraint constraint)
Adds the specified constraint to the linear constraint map, thus recording
which constraint lies to the left side of the edge.
|
IConstraint |
EdgePool.getBorderConstraint(IQuadEdge edge)
Gets the border constraint associated with the edge.
|
IConstraint |
EdgePool.getLinearConstraint(IQuadEdge edge)
Gets the linear constraint associated with the edge, if any.
|
void |
EdgePool.removeBorderConstraintFromMap(IQuadEdge edge)
Removes any existing border constraint from the constraint map.
|
Constructor and Description |
---|
QuadEdgePinwheel(IQuadEdge e0) |
Modifier and Type | Method and Description |
---|---|
List<IQuadEdge> |
NaturalNeighborInterpolator.getBowyerWatsonEnvelope(double x,
double y)
Gets a list of edges for the polygonal cavity that would be created
as part of the Bowyer-Watson insertion algorithm.
|
Modifier and Type | Method and Description |
---|---|
double[] |
NaturalNeighborInterpolator.getBarycentricCoordinates(List<IQuadEdge> 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.
|
Modifier and Type | Class and Description |
---|---|
class |
SemiVirtualEdge
Provides methods and elements implementing the QuadEdge data structure using
a virtual representation of the links based on integer arrays rather than
direct class instances.
|
Modifier and Type | Method and Description |
---|---|
Iterable<IQuadEdge> |
SemiVirtualIncrementalTin.edges() |
Iterator<IQuadEdge> |
SemiVirtualIncrementalTin.getEdgeIterator() |
List<IQuadEdge> |
SemiVirtualIncrementalTin.getEdges()
Gets a list of edges currently allocated by an instance.
|
List<IQuadEdge> |
SemiVirtualIncrementalTin.getPerimeter()
Gets a list of edges currently defining the perimeter of the TIN.
|
Iterable<IQuadEdge> |
SemiVirtualEdge.pinwheel() |
Modifier and Type | Method and Description |
---|---|
IConstraint |
SemiVirtualIncrementalTin.getLinearConstraint(IQuadEdge edge) |
IConstraint |
SemiVirtualIncrementalTin.getRegionConstraint(IQuadEdge edge) |
Vertex |
SemiVirtualIncrementalTin.splitEdge(IQuadEdge eInput,
double zSplit,
boolean restoreConformity) |
Modifier and Type | Method and Description |
---|---|
Iterable<IQuadEdge> |
IncrementalTin.edges() |
Iterator<IQuadEdge> |
IncrementalTin.getEdgeIterator() |
List<IQuadEdge> |
IncrementalTin.getEdges()
Gets a list of edges currently allocated by an instance.
|
List<IQuadEdge> |
IncrementalTin.getPerimeter()
Gets a list of edges currently defining the perimeter of the TIN.
|
Modifier and Type | Method and Description |
---|---|
IConstraint |
IncrementalTin.getLinearConstraint(IQuadEdge edge) |
IConstraint |
IncrementalTin.getRegionConstraint(IQuadEdge edge) |
Vertex |
IncrementalTin.splitEdge(IQuadEdge eInput,
double zSplit,
boolean restoreConformity) |
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).
|
Modifier and Type | Method and Description |
---|---|
static Polyside.Result |
Polyside.isPointInPolygon(List<IQuadEdge> list,
double x,
double y)
Determines if a point is inside a polygon.
|
Modifier and Type | Method and Description |
---|---|
List<IQuadEdge> |
ThiessenPolygon.getEdges()
Gets the edges that comprise the polygon
|
List<IQuadEdge> |
BoundedVoronoiDiagram.getEdges()
Gets a list of the edges in the Voronoi Diagram.
|
Modifier and Type | Method and Description |
---|---|
void |
BoundedVoronoiDrawingUtility.drawEdges(Graphics g,
Color foreground,
double strokeWidth,
List<IQuadEdge> edgeList)
Draws a the edges from the specified list.
|
Constructor and Description |
---|
ThiessenPolygon(Vertex vertex,
List<IQuadEdge> edgeList,
boolean open)
Constructs a Thiessen Polygon representation.
|
Copyright © 2021. All rights reserved.