All Classes

Class	Description
AlphaCircle	Provides definitions to be used for alpha-shape construction or other applications for a pair of circles of radius r that intersects the endpoints of a line segment.
AlphaPart	Provides a set of edges that define the path of an alpha shape.
AlphaPartType	Specifies the geometry of an AlphaPart instance.
AlphaShape	Provides methods and elements to support the creation of an alpha shape from a Delaunay triangulation.
AxisIntervals	Provides a utility for computing the intervals for labeling a coordinate axis in a legend or other graph.
BarycentricCoordinates	Implements utilities for computing Barycentric Coordinates.
BasicTabulator	Provides methods and elements for tabulating simple statistics for a set of values.
BootstrapUtility	A utility for performing the part of the bootstrap operation that is common to both the standard and virtual incremental TIN implementations.
BootstrapUtility.BootstrapTestResult	Indicates the results of the evaluation for a set of input points.
BoundedVoronoiBuildOptions	Specifies options for building a bounded Voronoi Diagram
BoundedVoronoiDiagram	Constructs a Voronoi Diagram structure from a set of sample points.
BoundedVoronoiDrawingUtility	Provides utilities for drawing graphical representations of a BoundedVoronoiDiagram instance.
BoundedVoronoiIntegrityCheck	Provides tools for checking the correctness of the construction of a Voronoi Diagram.
BoundedVoronoiRenderingType	Defines methods that supply style information for rendering.
BoundedVoronoiStylerAdapter	A base implementation of the styler interface provided as a convenience.
BoundedVoronoiStylerDefault	A default implementation of the styler interface.
BoundedVoronoiVertexSymbol	The default renderer for vertices in a drawing of a BoundedVoronoiDiagram instance.
BufferedRandomAccessFile	Provides a wrapper around a Java Random Access File which supports buffered I/O, dramatically improving the performance for many kinds of random-access file read and write operations.
BufferedRandomAccessReader	Accesses a random access file using a ByteBuffer with little-endian byte order in support of the LAS file format.
Circumcircle	Provides center coordinates and radius for a circumcircle.
Contour	Provides methods and elements for constructing a contour.
Contour.ContourType	An enumeration that indicates the type of a contour
ContourBuilderForTin	Provides data elements and methods for constructing contours from a Delaunay Triangulation.
ContourIntegrityCheck	Provides methods for checking the correctness of implementation for Tinfour contour building operations.
ContourRegion	Provides a elements and access methods for a region created through a contour-building process.
ContourRegion.ContourRegionType	An enumeration that indicates the type of a contour region.
ContourUtilities	Provides utility methods for application that perform contouring.
CoordinatePair	A simple container for holding the results of a coordinate transform.
DD	Implements extended-precision floating-point numbers which maintain 106 bits (approximately 30 decimal digits) of precision.
DelimitedReader	A utility for reading a file consisting of strings separated by a delimiter character, such as the classic comma-separated-value (CSV) or tab-delimited file formats.
EdgePool	Provides an object-pool implementation that the manages the allocation, deletion, and reuse of Edges.
GeometricOperations	Provides elements and methods to support geometric operations using "double double" precision where necessary.
GridFileReader	Provides a utility for reading a file specified in the Esri ASCII file format.
GridSpecification	Provides metadata for describing a grid and mapping Cartesian coordinates to and from grid coordinates.
GridSpecification.CellPosition	Specifies how the cells are oriented relative to the coordinates of the of the grid.
HilbertSort	A utility that sorts points according to the Hilbert space-filling curve and ensures a high-degree of spatial locality in the sequence of points.
IBoundedVoronoiStyler	Defines methods that supply style information for rendering.
IBoundedVoronoiVertexSymbol	Defines methods for rendering vertex symbols when drawing a bounded Voronoi diagram.
IConstraint	Defines the interface for constraints that can be added to instances of the Incremental TIN classes.
ICoordinateTransform	Defines an interface for performing coordinate transforms.
IDelaunayRefiner	A DelaunayRefiner refines a given triangulation to improve its quality, for example by increasing minimum angles or enforcing other geometric properties.
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.
IInterpolatorOverTin	Defines an interface for interpolating data over a Triangulated Irregular Network implementation.
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.
IncrementalTin	Provides methods and data elements for building and maintaining a Triangulated Irregular Network (TIN) that is optimal with regard to the Delaunay criterion.
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.
InsufficientConstraintGeometryException	Defines an exception to be thrown in cases where the set of constraints is insufficient to bootstrap a non-bootstrapped) instance of an Incremental TIN.
IntegrityCheck	A tool for checking the correctness of a tin, in particular the relationship between adjacent triangles.
InverseDistanceWeightingInterpolator	Provides interpolation based on the classic method of inverse distance weighting (IDW).
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.
IVertexReader	Defines methods to be used for reading a set of vertices from various input sources.
IVertexValuator	An interface for specifying methods of accessing a value from a Vertex.
IVerticalCoordinateTransform	Defines an interface for transforming the vertical coordinate value of a feature when loading it.
KahanSummation	Provides methods and elements for Kahan's algorithm for summing a set of numerical values with extended precision arithmetic.
LinearConstraint	An implementation of the IConstraint interface intended to store constraints comprised of a chain of connected line segments.
LinearUnits	An enumeration for specifying linear units of measure.
NaturalNeighborElements	Provides a simple container for the component elements computed during a natural neighbor interpolation.
NaturalNeighborElements.ResultType	Indicate the kind of results that are stored in this instance.
NaturalNeighborInterpolator	Provides interpolations based on Sibson's Natural Neighbor Interpolation method.
NearestEdgeResult	Provides a minimal set of data elements for the result of a nearest-edge location operation.
NearestNeighborPointCollector	Provides a utility for the efficient identification of the K-nearest points to a specified set of query coordinates.
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.
PolylineThinner	Provides utilities for reducing the number of points in a polygon or line feature by using Visvalingam's algorithm.
Polyside	A utility for determining whether a specified coordinate is inside a polygon defined by IQuadEdge instances.
Polyside.Result	An enumeration indicating the result of a point-in-poygon test
QuadEdge	A representation of an edge with forward and reverse links on one side and counterpart links attached to its dual (other side).
QuadEdgeConstants	Defines constants for use in QuadEdge related operations.
QuadEdgePinwheel	Provides an implementation of the pinwheel operation via the Iterator and Iterable interfaces.
RendererForTinInspection	Provides a utility for rendering instances of the incremental TIN classes (the Delaunay triangulation classes) to an image.
RenderingSurfaceAid	Creates data elements suitable for rendering 2D graphics based on a Cartesian coordinate system.
RenderingTransformAid	Provides an aid for establishing a Cartesian coordinate system for rendering 2D drawings as well as utilities for initializing a graphics surface.
RuppertRefiner	RuppertRefiner implements Ruppert’s Delaunay refinement for improving mesh quality of an IIncrementalTin.
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.
SemiVirtualIncrementalTin	Provides a memory-conserving variation on the IncrementalTin class for building and maintaining a Triangulated Irregular Network (TIN) that is optimal with regard to the Delaunay criterion.
SemiVirtualStochasticLawsonsWalk	Methods and definitions to perform a stochastic Lawson's walk.
SimpleGeographicTransform	Provides a rudimentary implementation of a geographic transform.
SimpleTriangle	Provides methods and elements for a simple representation of a triangle based on IQuadEdge edges.
SimpleTriangleIterator	An implementation of an iterator for looping through the triangles implicit in a Triangulated Irregular Network.
SmoothingFilter	An implementation of the vertex valuator that processes the vertices in a Constrained Delaunay Triangulation and applies a low-pass filter over the data.
SmoothingFilterInitializer	An implementation of the vertex valuator that processes the vertices in a Constrained Delaunay Triangulation and applies a low-pass filter over the data.
StochasticLawsonsWalk	Methods and definitions to perform a stochastic Lawson's walk.
ThiessenPolygon	Provides elements and methods for representing a Thiessen Polygon created by the BoundedVoronoi class.
Thresholds	Provides a standard calculation of threshold values appropriate for use in an incremental TIN implementation based on nominal point spacing.
Tincalc	Provides simple calculations useful for various Tinfour operations.
TinInstantiationUtility	Provides a utility for instantiating either the QuadEdge or virtual versions of the TIN class based on the amount of memory available
TriangleCollector	Provides a utility for collecting triangles from a TIN.
TriangleCount	Provides descriptive data for a Triangulated Irregular Network (TIN).
TriangularFacetInterpolator	Provides interpolation based on treating the surface as a collection of planar triangular facets.
TriangularFacetSpecialInterpolator	Provides interpolation based on treating the surface as a collection of triangular facets with special handling for regions outside the domain of the Delaunay triangulation.
Vertex	Represents a point in a connected network on a planar surface.
VertexAdjustment	Provides a wrapper class used to represent the adjusted position of a vertex.
VertexColorizerKempe6	Assign vertices color index values so that no two connected vertices have the same color.
VertexIterator	An implementation of an iterator for looping through the vertices that form a Triangulated Irregular Network.
VertexMergerGroup	A synthetic vertex used to handle cases when multiple vertices occupy coincident locations.
VertexMergerGroup.ResolutionRule	Specifies a rule for determining a z value based on the collection of coincident vertices.
VertexReaderText	A utility for loading vertices from a file for testing.
VertexValuatorDefault	A valuator that returns the Z coordinate of a vertex.
VisvalingamLineSimplification	Provides an implementation of Visvalingam's algorithm for simplifying lines by repeated elimination of the smallest area features.