All Classes
| Class | Description |
|---|---|
| AxisAlignedBoundingBox |
A class that enable to Compute the axis aligned bounding box for the spatial objects given in parameter.
|
| ConvexDecomposition |
This class enable to compute a convex decomposition for a given polyhedron.
The convex decomposition split a non convex polyhedron is a set of convex polyhedra such that their union is the original polyhedra. This class implements the algorithm given in "An Algorithm for Convex Decomposition for polyedral object", Proceeding of the Seventh International conference on computer aided Design and Computer Graphics, International Academic Publishers, August 22-24 2001 by Wang Fei, LIU Wen-Yu, Li Huain . |
| 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). |
| DelaunayException |
A exception that can be raised during Delaunay triangulation computation.
|
| 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. |
| MeshNeighborhoodComputation |
Computation of the neighborhood of a mesh.
|
| MinimalEnclosingParallelepipede |
This class is an implementation of the algorithm given in "Minimal Enclosing Parallelepiped in 3D", december 2002 by
Frédéric Vivien and Nicolas Wicker (Laboratoire de l'Informatique du parallelisme,
Ecole Normale supérieure de Lyon, UMR cnrs-inria-ens Lyon 5668).
|
| PlaneFitting |
Compute a plane from a
set of 3D points using a Linear Least Square based method. |
| QuickHull |
This class provide convex hull computation for a set of points using the convex hull algorithm given in
"The Quickhull Algorithm for Convex Hulls."
|
| VoronoiTriangle |
A Vorinoi triangle.
|