ProGAL.geom2d

Class Triangulation

java.lang.Object

ProGAL.geom2d.Triangulation

public class Triangulation
extends java.lang.Object

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	Triangulation.TriangulationAlgorithm

Field Summary

Fields

Modifier and Type	Field and Description
java.util.List<TriangulationFace>	triangulationFaces
java.util.List<TriangulationVertex>	vertices

Constructor Summary

Constructors

Constructor and Description
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

Modifier and Type	Method and Description
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)
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)
boolean	isDelaunay()
void	legalizeEdge(TriangulationFace triangulationFace, int indx, boolean recursive)
void	legalizeEdge(TriangulationFace triangulationFace, int indx, boolean recursive, J2DScene scene)
void	print() prints vertices and faces of the triangulation

Methods inherited from class java.lang.Object

clone, equals, finalize, 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)

isDelaunay

public boolean isDelaunay()

print

public void print()

prints vertices and faces of the triangulation