3D triangulations

3D triangulations. CGAL user and reference manual: The basic 3D-triangulation class of CGAL is primarily designed to represent the triangulations of a set of points A in R3. It is a partition of the convex hull of A into tetrahedra whose vertices are the points of A. Together with the unbounded cell having the convex hull boundary as its frontier, the triangulation forms a partition of R3. Its cells ( 3-faces) are such that two cells either do not intersect or share a common facet ( 2-face), edge ( 1-face) or vertex ( 0-face) ...