ProGAL.geom2d
Class Triangulation

java.lang.Object
  extended by ProGAL.geom2d.Triangulation

public class Triangulation
extends java.lang.Object


Nested Class Summary
static class Triangulation.TriangulationAlgorithm
           
 
Field Summary
 java.util.List<TriangulationFace> triangulationFaces
           
 java.util.List<TriangulationVertex> vertices
           
 
Constructor Summary
Triangulation(PointSet points, Triangulation.TriangulationAlgorithm algorithm)
          creates a triangulation of a set of points Two triangulation algorithms are so far implemented: Greedy, Delaunay
 
Method Summary
 void boundaryFlipIn(TriangulationVertex a, TriangulationVertex b, TriangulationVertex c)
           
 void boundaryFlipIn(TriangulationVertex a, TriangulationVertex b, TriangulationVertex c, J2DScene scene, boolean testing)
           
 void boundaryFlipOut(TriangulationVertex v, TriangulationFace face, J2DScene scene, boolean testing)
           
 void delete(TriangulationVertex u, J2DScene scene)
           
 void draw(J2DScene scene)
           
 TriangulationFace findFirstTriangulationFace(TriangulationVertex v)
          returns the first TriangulationFace incident with vertex v (null if v is not on the convex hull and therefore has no last TriangulationFace
 TriangulationFace findLastTriangulationFace(TriangulationVertex v)
          returns the last TriangulationFace incident with vertex v (null if v is not on the convex hull and therefore has no last TriangulationFace
 TriangulationFace findNextTriangulationFace(TriangulationVertex u, TriangulationVertex v)
          returns next (left when looking from vertex u to vertex v) TriangulationFace.
 TriangulationFace findPrevTriangulationFace(TriangulationVertex u, TriangulationVertex v)
          returns the previous (right when looking from vertex u to vertex v) TriangulationFace.
 TriangulationFace findTriangulationFace(TriangulationVertex u, TriangulationVertex v, TriangulationVertex w)
          returns TriangulationFace with specified vertices.
 TriangulationFace[] flip(TriangulationFace t013, TriangulationFace t123, boolean recursive)
           
 TriangulationFace[] flip(TriangulationFace t013, TriangulationFace t123, boolean recursive, J2DScene scene, boolean testing)
           
 void legalizeEdge(TriangulationFace triangulationFace, int indx, boolean recursive)
           
 void legalizeEdge(TriangulationFace triangulationFace, int indx, boolean recursive, J2DScene scene)
           
static void main(java.lang.String[] args)
           
 void print()
           
 
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

vertices

public java.util.List<TriangulationVertex> vertices

triangulationFaces

public java.util.List<TriangulationFace> triangulationFaces
Constructor Detail

Triangulation

public Triangulation(PointSet points,
                     Triangulation.TriangulationAlgorithm algorithm)
creates a triangulation of a set of points Two triangulation algorithms are so far implemented: Greedy, Delaunay

Method Detail

findTriangulationFace

public TriangulationFace findTriangulationFace(TriangulationVertex u,
                                               TriangulationVertex v,
                                               TriangulationVertex w)
returns TriangulationFace with specified vertices. If not found, creates such a TriangulationFace


findNextTriangulationFace

public TriangulationFace findNextTriangulationFace(TriangulationVertex u,
                                                   TriangulationVertex v)
returns next (left when looking from vertex u to vertex v) TriangulationFace.


findPrevTriangulationFace

public TriangulationFace findPrevTriangulationFace(TriangulationVertex u,
                                                   TriangulationVertex v)
returns the previous (right when looking from vertex u to vertex v) TriangulationFace.


findLastTriangulationFace

public TriangulationFace findLastTriangulationFace(TriangulationVertex v)
returns the last TriangulationFace incident with vertex v (null if v is not on the convex hull and therefore has no last TriangulationFace


findFirstTriangulationFace

public TriangulationFace findFirstTriangulationFace(TriangulationVertex v)
returns the first TriangulationFace incident with vertex v (null if v is not on the convex hull and therefore has no last TriangulationFace


legalizeEdge

public void legalizeEdge(TriangulationFace triangulationFace,
                         int indx,
                         boolean recursive)

legalizeEdge

public void legalizeEdge(TriangulationFace triangulationFace,
                         int indx,
                         boolean recursive,
                         J2DScene scene)

flip

public TriangulationFace[] flip(TriangulationFace t013,
                                TriangulationFace t123,
                                boolean recursive)

flip

public TriangulationFace[] flip(TriangulationFace t013,
                                TriangulationFace t123,
                                boolean recursive,
                                J2DScene scene,
                                boolean testing)

boundaryFlipOut

public void boundaryFlipOut(TriangulationVertex v,
                            TriangulationFace face,
                            J2DScene scene,
                            boolean testing)

boundaryFlipIn

public void boundaryFlipIn(TriangulationVertex a,
                           TriangulationVertex b,
                           TriangulationVertex c)

boundaryFlipIn

public void boundaryFlipIn(TriangulationVertex a,
                           TriangulationVertex b,
                           TriangulationVertex c,
                           J2DScene scene,
                           boolean testing)

delete

public void delete(TriangulationVertex u,
                   J2DScene scene)

print

public void print()

draw

public void draw(J2DScene scene)

main

public static void main(java.lang.String[] args)