Package | Description |
---|---|
org.tinfour.common |
Provides classes and interfaces that are common to multiple
packages within the TinFour project.
|
org.tinfour.contour |
Provides classes in support of contouring from Delaunay Triangulations
|
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
|
Class and Description |
---|
BootstrapUtility.BootstrapTestResult
Indicates the results of the evaluation for a set of input points.
|
Circumcircle
Provides center coordinates and radius for a circumcircle.
|
IConstraint
Defines the interface for constraints that can be added to
instances of the Incremental TIN classes.
|
IIncrementalTin
Defines the primary methods used by an incremental TIN
implementation.
|
IIncrementalTinNavigator
Provides utilities for performing geometry-based query operations
on an incremental tin.
|
IIntegrityCheck
Defines methods to be used for checking the correctness of code
for Incremental TIN implementations.
|
IMonitorWithCancellation
Provides an interface that allows an process to report its progress to
a monitoring application and also permits the implementation of a
"voluntary cancellation" action.
|
INeighborEdgeLocator
Defines methods for a reusable instance of a class for searching a TIN and
locating the neighboring edge.
|
INeighborhoodPointsCollector
Defines an interface for collecting the points in the
proximity of a specified pair of coordinates.
|
IPolyline
An interface for defining a polyline feature (a polygon or chain of
connected line segments).
|
IProcessUsingTin
An interface for classes that perform processing on a TIN.
|
IQuadEdge
Defines methods for accessing the data in a quad-edge
implementation.
|
ISamplePoint
Defines a sample point interface to be used for spatial
data analysis.
|
LinearConstraint
An implementation of the IConstraint interface intended to store
constraints comprised of a chain of connected line segments.
|
NearestEdgeResult
Provides a minimal set of data elements for the result of a nearest-edge
location operation.
|
NeighborEdgeVertex
Provides a minimal set of data elements for the result of a neighbor-edge
location operation.
|
PolygonConstraint
An implementation of the IConstraint interface intended to store
constraints comprised of a polygon.
|
PolyLineConstraintAdapter
An implementation of the IConstraint interface intended to store constraints
comprised of a chain of connected line segments.
|
SimpleTriangle
Provides methods and elements for a simple representation of a triangle based
on IQuadEdge edges.
|
Thresholds
Provides a standard calculation of threshold values appropriate for use in an
incremental TIN implementation based on nominal point spacing.
|
TriangleCount
Provides descriptive data for a Triangulated Irregular Network (TIN).
|
Vertex
Represents a point in a connected network on a planar surface.
|
VertexMergerGroup.ResolutionRule
Specifies a rule for determining a z value based on the collection
of coincident vertices.
|
Class and Description |
---|
IIncrementalTin
Defines the primary methods used by an incremental TIN
implementation.
|
Class and Description |
---|
IConstraint
Defines the interface for constraints that can be added to
instances of the Incremental TIN classes.
|
IQuadEdge
Defines methods for accessing the data in a quad-edge
implementation.
|
Vertex
Represents a point in a connected network on a planar surface.
|
Class and Description |
---|
IIncrementalTin
Defines the primary methods used by an incremental TIN
implementation.
|
IProcessUsingTin
An interface for classes that perform processing on a TIN.
|
IQuadEdge
Defines methods for accessing the data in a quad-edge
implementation.
|
Vertex
Represents a point in a connected network on a planar surface.
|
Class and Description |
---|
IConstraint
Defines the interface for constraints that can be added to
instances of the Incremental TIN classes.
|
IIncrementalTin
Defines the primary methods used by an incremental TIN
implementation.
|
IIncrementalTinNavigator
Provides utilities for performing geometry-based query operations
on an incremental tin.
|
IIntegrityCheck
Defines methods to be used for checking the correctness of code
for Incremental TIN implementations.
|
IMonitorWithCancellation
Provides an interface that allows an process to report its progress to
a monitoring application and also permits the implementation of a
"voluntary cancellation" action.
|
INeighborEdgeLocator
Defines methods for a reusable instance of a class for searching a TIN and
locating the neighboring edge.
|
INeighborhoodPointsCollector
Defines an interface for collecting the points in the
proximity of a specified pair of coordinates.
|
IQuadEdge
Defines methods for accessing the data in a quad-edge
implementation.
|
SimpleTriangle
Provides methods and elements for a simple representation of a triangle based
on IQuadEdge edges.
|
Thresholds
Provides a standard calculation of threshold values appropriate for use in an
incremental TIN implementation based on nominal point spacing.
|
TriangleCount
Provides descriptive data for a Triangulated Irregular Network (TIN).
|
Vertex
Represents a point in a connected network on a planar surface.
|
VertexMergerGroup.ResolutionRule
Specifies a rule for determining a z value based on the collection
of coincident vertices.
|
Class and Description |
---|
IConstraint
Defines the interface for constraints that can be added to
instances of the Incremental TIN classes.
|
IIncrementalTin
Defines the primary methods used by an incremental TIN
implementation.
|
IIncrementalTinNavigator
Provides utilities for performing geometry-based query operations
on an incremental tin.
|
IIntegrityCheck
Defines methods to be used for checking the correctness of code
for Incremental TIN implementations.
|
IMonitorWithCancellation
Provides an interface that allows an process to report its progress to
a monitoring application and also permits the implementation of a
"voluntary cancellation" action.
|
INeighborEdgeLocator
Defines methods for a reusable instance of a class for searching a TIN and
locating the neighboring edge.
|
INeighborhoodPointsCollector
Defines an interface for collecting the points in the
proximity of a specified pair of coordinates.
|
IQuadEdge
Defines methods for accessing the data in a quad-edge
implementation.
|
SimpleTriangle
Provides methods and elements for a simple representation of a triangle based
on IQuadEdge edges.
|
Thresholds
Provides a standard calculation of threshold values appropriate for use in an
incremental TIN implementation based on nominal point spacing.
|
TriangleCount
Provides descriptive data for a Triangulated Irregular Network (TIN).
|
Vertex
Represents a point in a connected network on a planar surface.
|
VertexMergerGroup.ResolutionRule
Specifies a rule for determining a z value based on the collection
of coincident vertices.
|
Class and Description |
---|
IConstraint
Defines the interface for constraints that can be added to
instances of the Incremental TIN classes.
|
IIncrementalTin
Defines the primary methods used by an incremental TIN
implementation.
|
IPolyline
An interface for defining a polyline feature (a polygon or chain of
connected line segments).
|
IQuadEdge
Defines methods for accessing the data in a quad-edge
implementation.
|
SimpleTriangle
Provides methods and elements for a simple representation of a triangle based
on IQuadEdge edges.
|
Vertex
Represents a point in a connected network on a planar surface.
|
VertexMergerGroup.ResolutionRule
Specifies a rule for determining a z value based on the collection
of coincident vertices.
|
Class and Description |
---|
IMonitorWithCancellation
Provides an interface that allows an process to report its progress to
a monitoring application and also permits the implementation of a
"voluntary cancellation" action.
|
Vertex
Represents a point in a connected network on a planar surface.
|
Class and Description |
---|
IIncrementalTin
Defines the primary methods used by an incremental TIN
implementation.
|
IQuadEdge
Defines methods for accessing the data in a quad-edge
implementation.
|
Vertex
Represents a point in a connected network on a planar surface.
|
Copyright © 2021. All rights reserved.