Uses of Package
org.jeometry.geom3D.algorithm.delaunay.clarkson
| Package | Description |
|---|---|
| org.jeometry.geom3D.algorithm.delaunay.clarkson |
-
Classes in org.jeometry.geom3D.algorithm.delaunay.clarkson used by org.jeometry.geom3D.algorithm.delaunay.clarkson 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 ofnpoints in aO(n x log(n))average time with a worst case inO(n x n).DelaunayException A exception that can be raised during Delaunay triangulation computation.DelaunayTetrahedralization A Delaunay tetrahedralization regarding Ken Clarkson hull algorithm.DelaunayTetrahedron Atetrahedronthat comes from a Delaunay tetrahedralization.DelaunayVertice An implementation ofPoint3Dthan embeed delaunay computation needed informations.VoronoiTriangle A Vorinoi triangle.