See: Description
| Interface | 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.
|
| 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.
|
| Class | Description |
|---|---|
| BootstrapUtility |
A utility for performing the part of the bootstrap operation that is common
to both the standard and virtual incremental TIN implementations.
|
| Circumcircle |
Provides center coordinates and radius for a circumcircle.
|
| GeometricOperations |
Provides elements and methods to support geometric operations
using "double double" precision where necessary.
|
| 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.
|
| SimpleTriangleIterator |
An implementation of an iterator for looping through the triangles
implicit in a Triangulated Irregular Network.
|
| 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.
|
| VertexAdjustment |
Provides a wrapper class used to represent the adjusted position
of a vertex.
|
| 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.
|
| Enum | Description |
|---|---|
| BootstrapUtility.BootstrapTestResult |
Indicates the results of the evaluation for a set of input points.
|
| VertexMergerGroup.ResolutionRule |
Specifies a rule for determining a z value based on the collection
of coincident vertices.
|
Copyright © 2021. All rights reserved.