\( \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.8 - 3D Triangulations

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes
Concepts
3D Triangulations Reference

##

## Concepts
concept | DelaunayTriangulationCellBase_3
| The base cell of a Delaunay triangulation has to be a model of the concept `DelaunayTriangulationCellBase_3`, which refines the concept `TriangulationCellBase_3` by adding in the cell an operator that computes its circumcenter. More...
concept | DelaunayTriangulationTraits_3
| The concept `DelaunayTriangulationTraits_3` is the first template parameter of the class `Delaunay_triangulation_3`. It defines the geometric objects (points, segments...) forming the triangulation together with a few geometric predicates and constructions on these objects. More...
concept | RegularTriangulationCellBase_3
| The regular triangulation of a set of weighted points does not necessarily have one vertex for each of the input points. Some of the input weighted points have no cell in the dual power diagrams and therefore do not correspond to a vertex of the regular triangulation. Those weighted points are said to be hidden points. A point which is hidden at a given time may appear later as a vertex of the regular triangulation upon removal on some other weighted point. Therefore, hidden points have to be stored somewhere. The regular triangulation stores those hidden points in its cells. More...
concept | RegularTriangulationTraits_3
| The concept `RegularTriangulationTraits_3` is the first template parameter of the class `CGAL::Regular_triangulation_3`. It defines the geometric objects (points, segments...) forming the triangulation together with a few geometric predicates and constructions on these objects. More...
concept | TriangulationCellBase_3
| The cell base required by the basic triangulation does not need to store any geometric information, so only the requirements of the triangulation data structure apply. More...
concept | TriangulationCellBaseWithInfo_3
| A type model of this concept can be used as cell base by a triangulation and provides an additional information storage. More...
concept | TriangulationTraits_3
| The concept `TriangulationTraits_3` is the first template parameter of the class `Triangulation_3`. It defines the geometric objects (points, segments, triangles and tetrahedra) forming the triangulation together with a few geometric predicates and constructions on these objects : lexicographical comparison, orientation in case of coplanar points and orientation in space. More...
concept | TriangulationVertexBase_3
| The vertex base used by the geometric triangulation must store a point. So we list here the additional requirements compared to a vertex base usable for the triangulation data structure. More...
concept | TriangulationVertexBaseWithInfo_3
| A type model of this concept can be used as vertex base by a triangulation and provides an additional information storage. More...
concept | WeightedPoint