Class IncrementalTinDual

java.lang.Object
micycle.pgs.commons.IncrementalTinDual

public class IncrementalTinDual extends Object
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
  • Field Details

    • edges

      public final List<IncrementalTinDual.DualEdge> edges
      List of all edges in the dual graph.
    • edgeDuals

      public final Map<org.tinfour.common.IQuadEdge,IncrementalTinDual.DualEdge> edgeDuals
      Maps triangulation edges to their dual edge.
    • vertexDuals

      public final Map<org.tinfour.common.Vertex,processing.core.PShape> 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.