Module org.jeometry.algorithm

Package org.jeometry.geom3D.algorithm.delaunay.clarkson

Class Summary

Class	Description
DelaunayClarkson	This class is an implementation of the Ken Clarkson hull algorithm that enable to compute convex hull in n-dimension. This algorithm compute a convex hull for a set of n points in a O(n x log(n)) average time with a worst case in O(n x n).
DelaunayClarkson3D<T extends Point3D>	This class is an implementation of the Ken Clarkson hull algorithm that enable to compute convex hull in n-dimension. This algorithm compute a convex hull for a set of n points in a O(n x log(n)) average time with a worst case in O(n x n).
DelaunayTetrahedralization<T extends Point3D>	A Delaunay tetrahedralization regarding Ken Clarkson hull algorithm.
DelaunayTetrahedron<T extends Point3D>	A tetrahedron that comes from a Delaunay tetrahedralization.
DelaunayVertice<T extends Point3D>	An implementation of Point3D than embeed delaunay computation needed informations.
VoronoiTriangle	A Vorinoi triangle.

Exception Summary

Exception	Description
DelaunayException	A exception that can be raised during Delaunay triangulation computation.