Package micycle.pgs.commons
Class IncrementalTinDual
java.lang.Object
micycle.pgs.commons.IncrementalTinDual
Produces a (barycentric) dual graph from a TinFour Delaunay Triangulation.
Triangle centroids form the vertices of the dual graph, and each
triangulation vertex corresponds to a face in the dual graph; the dual graph
has similarity to the voronoi diagram, but it isn't the same.
The dual of (fairly) regular triangulation is a regular polygonal (hex/oct) mesh.
- Author:
- Michael Carleton
-
Nested Class Summary
Nested Classes -
Field Summary
FieldsModifier and TypeFieldDescriptionfinal Map<org.tinfour.common.IQuadEdge,
IncrementalTinDual.DualEdge> Maps triangulation edges to their dual edge.final List<IncrementalTinDual.DualEdge>
List of all edges in the dual graph.final Map<org.tinfour.common.Vertex,
processing.core.PShape> Maps triangulation vertices to their corresponding/surrounding face in the dual graph. -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionprocessing.core.PShape
getMesh()
Generate mesh of polygonal dual faces.
-
Field Details
-
edges
List of all edges in the dual graph. -
edgeDuals
Maps triangulation edges to their dual edge. -
vertexDuals
Maps triangulation vertices to their corresponding/surrounding face in the dual graph.
-
-
Constructor Details
-
IncrementalTinDual
public IncrementalTinDual(org.tinfour.common.IIncrementalTin tin)
-
-
Method Details
-
getMesh
public processing.core.PShape getMesh()Generate mesh of polygonal dual faces.
-