Package fr.inria.zvtm.layout.delaunay

Algorithms for computing geometrical information about sets of points, such as the Delaunay triangulation and Voronoi tessellation.

See: Description

Class Summary

Class	Description
DelaunayTriangulation	A 2D Delaunay Triangulation (DT) with incremental site insertion.
Pnt	Points in Euclidean space, implemented as double[].
Simplex<V>	A Simplex is an immutable set of vertices (usually Pnts).
Triangulation<V>	A Triangulation on vertices (generic type V).

Package fr.inria.zvtm.layout.delaunay Description

Algorithms for computing geometrical information about sets of points, such as the Delaunay triangulation and Voronoi tessellation.