| 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.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 IIncrementalTin | PolyLineConstraintAdapter. maintainingTin | 
| Modifier and Type | Method and Description | 
|---|---|
| IIncrementalTin | PolyLineConstraintAdapter. getManagingTin() | 
| IIncrementalTin | IConstraint. getManagingTin()Gets the instance of the incremental TIN interface that 
 is managing this constraint, if any. | 
| Modifier and Type | Method and Description | 
|---|---|
| void | PolyLineConstraintAdapter. setConstraintIndex(IIncrementalTin tin,
                  int index) | 
| void | IConstraint. setConstraintIndex(IIncrementalTin tin,
                  int index)Sets an index value used for internal bookkeeping by Tinfour code;
 not intended for use by application code. | 
| Constructor and Description | 
|---|
| 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. | 
| SimpleTriangleIterator(IIncrementalTin tin)Construct an instance of the iterator based on the specified
 Incremental TIN structure. | 
| TriangleCount(IIncrementalTin tin)A constructor that performs a survey of the TIN to gather statistics
 about the triangles that comprise it. | 
| VertexIterator(IIncrementalTin tin)Construct an instance of the iterator based on the specified
 Incremental TIN structure. | 
| Constructor and Description | 
|---|
| ContourBuilderForTin(IIncrementalTin tin,
                    IVertexValuator vertexValuator,
                    double[] zContour,
                    boolean buildRegions)Creates a set of contours at the specified vertical coordinates from the
 Delaunay Triangulation. | 
| Modifier and Type | Method and Description | 
|---|---|
| static double | InverseDistanceWeightingInterpolator. computeAverageSampleSpacing(IIncrementalTin tin)Computes the average sample spacing. | 
| Constructor and Description | 
|---|
| InverseDistanceWeightingInterpolator(IIncrementalTin tin)Construct an interpolator that operates on the specified TIN. | 
| InverseDistanceWeightingInterpolator(IIncrementalTin tin,
                                    double parameter,
                                    boolean gaussian)Constructs an interpolator using the specified method. | 
| NaturalNeighborInterpolator(IIncrementalTin tin)Construct an interpolator that operates on the specified TIN. | 
| TriangularFacetInterpolator(IIncrementalTin tin)Construct an interpolator that operates on the specified TIN. | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | SemiVirtualIncrementalTinProvides 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. | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | IncrementalTinProvides methods and data elements for building and maintaining a
 Triangulated Irregular Network (TIN) that is optimal with regard to the
 Delaunay criterion. | 
| Modifier and Type | Method and Description | 
|---|---|
| IIncrementalTin | TinInstantiationUtility. constructInstance(Class<?> tinClass,
                 double nominalPointSpacing)Constructs an instance of the specified TIN class. | 
| IIncrementalTin | TinInstantiationUtility. constructInstance(double nominalPointSpacing)Uses the information about available memory use that was passed into
 the constructor to select a TIN class and construct and instance. | 
| Modifier and Type | Method and Description | 
|---|---|
| void | VertexColorizerKempe6. assignColorsToVertices(IIncrementalTin tin)Assign color index values to vertices. | 
| boolean | VertexColorizerKempe6. verifyAssignments(IIncrementalTin tin,
                 PrintStream ps)A test utility for verifying the results from the assignColorsToVertices
 method. | 
| static void | TriangleCollector. visitSimpleTriangles(IIncrementalTin tin,
                    Consumer<SimpleTriangle> consumer)Identify all valid triangles in the specified TIN and
 provide them to the application-supplied Consumer. | 
| static void | TriangleCollector. visitTriangles(IIncrementalTin tin,
              Consumer<Vertex[]> consumer)Identify all valid triangles in the specified TIN and
 provide them to the application-supplied Consumer. | 
| static void | TriangleCollector. visitTrianglesConstrained(IIncrementalTin tin,
                         Consumer<Vertex[]> consumer)Traverses the TIN, visiting all triangles that are members of a constrained
 region. | 
| Constructor and Description | 
|---|
| SmoothingFilter(IIncrementalTin tin)Construct a smoothing filter. | 
| SmoothingFilterInitializer(IIncrementalTin tin,
                          int nPasses)Construct a smoothing filter. | 
| Constructor and Description | 
|---|
| BoundedVoronoiDiagram(IIncrementalTin delaunayTriangulation)Constructs an instance of a Voronoi Diagram that corresponds to the input
 Delaunay Triangulation. | 
Copyright © 2021. All rights reserved.