Class PackedDelaunayGraph

java.lang.Object
georegression.delaunay.PackedDelaunayGraph

public class PackedDelaunayGraph extends Object
Triangles and graph structures used to build a Delaunay triangulation using incremental method. Whenever possible arrays are used instead of structures for memory efficiency. All triangles have their corners specified in a counter-clockwise direction.
  • Field Details

  • Constructor Details

    • PackedDelaunayGraph

      public PackedDelaunayGraph()
  • Method Details

    • reset

      public void reset()
    • reservePoints

      public void reservePoints(int size)
    • triangleCount

      public int triangleCount()
    • addPoint

      public void addPoint(double x, double y)
    • verifyTrianglesAreCCW

      public boolean verifyTrianglesAreCCW()
    • addTriangle

      public int addTriangle(int a, int b, int c)
      Adds a new triangle to the triangle list
      Parameters:
      a - Index of point A
      b - Index of point B
      c - Index of point C
      Returns:
      reference to the new triangle
    • removeTriangle

      public void removeTriangle(int reference)
    • getTriangle

      public TriIndex getTriangle(int reference, @Nullable @Nullable TriIndex triangle)
    • findTriangle

      public int findTriangle(int v0, int v1, int v2)
    • getCorners

      public Triangle2D_F64 getCorners(TriIndex corners, @Nullable @Nullable Triangle2D_F64 triangle)
    • getCorners

      public Triangle2D_F64 getCorners(int reference, @Nullable @Nullable Triangle2D_F64 triangle)
    • getTriangleCorner

      public void getTriangleCorner(int reference, int corner, Point2D_F64 point)
    • cornerPoint

      public int cornerPoint(int reference, int corner)
    • cornerPointW

      public int cornerPointW(int reference, int corner)