\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.4 - High-dimension Triangulation
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Refinement Relationships
Concept DelaunayTriangulationTraits
TriangulationTraits.
Concept TriangulationFullCell
TriangulationDSFullCell We only list below the additional specific requirements of TriangulationFullCell.
Concept TriangulationTraits
SpatialSortingTraits_d If a range of points is inserted, the traits must refine SpatialSortingTraits_d (this operation is optimized using spatial sorting). This is not required if the points are inserted one by one.
Class TriangulationVertex
TriangulationDSVertex We only list below the additional specific requirements of TriangulationVertex. Compared to TriangulationDSVertex, the main difference is the addition of an association of the vertex with a geometric point.