Package toxi.geom.mesh2d

Class DelaunayTriangulation

java.lang.Object
java.util.AbstractCollection<E>
java.util.AbstractSet<DelaunayTriangle>
toxi.geom.mesh2d.DelaunayTriangulation
All Implemented Interfaces:
Iterable<DelaunayTriangle>, Collection<DelaunayTriangle>, Set<DelaunayTriangle>
public class DelaunayTriangulation extends AbstractSet<DelaunayTriangle>
A 2D Delaunay DelaunayTriangulation (DT) with incremental site insertion. This is not the fastest way to build a DT, but it's a reasonable way to build a DT incrementally and it makes a nice interactive display. There are several O(n log n) methods, but they require that the sites are all known initially. A DelaunayTriangulation is a Set of Triangles. A DelaunayTriangulation is unmodifiable as a Set; the only way to change it is to add sites (via delaunayPlace).
Author:
Paul Chew Created July 2005. Derived from an earlier, messier version. Modified November 2007. Rewrote to use AbstractSet as parent class and to use the UndirectedGraph class internally. Tried to make the DT algorithm clearer by explicitly creating a cavity. Added code needed to find a Voronoi cell., Karsten Schmidt Ported to use toxiclibs classes (June 2010).