CGAL 4.7 - dD Triangulations: Refinement Relationships

\( \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.7 - dD Triangulations

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Refinement Relationships

Concept DelaunayTriangulationTraits
  TriangulationTraits.
Concept TriangulationDSFullCell
  `TriangulationDataStructure::FullCell`
Concept TriangulationDSVertex
  `TriangulationDataStructure::Vertex`
Concept TriangulationFullCell
  TriangulationDSFullCell We only list below the additional specific requirements of TriangulationFullCell.
Concept TriangulationTraits
  `SpatialSortingTraits_d`
Concept 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.