CGAL 6.1.2 - 3D Triangulation Data Structure: Class and Concept List

CGAL 6.1.2 - 3D Triangulation Data Structure

Loading...
Searching...
No Matches
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 12]

▼NCGAL |
C Triangulation_data_structure_3 | The class `Triangulation_data_structure_3` stores a 3D-triangulation data structure and provides the optional geometric functionalities to be used as a parameter for a 3D-geometric triangulation (see Chapter 3D Triangulations)
C Triangulation_ds_cell_base_3 | The class `Triangulation_ds_cell_base_3<>` is a model for the concept `TriangulationDSCellBase_3` to be used by `Triangulation_data_structure_3`
C Triangulation_ds_vertex_base_3 | The class `Triangulation_ds_vertex_base_3` can be used as the base vertex for a 3D-triangulation data structure, it is a model of the concept `TriangulationDSVertexBase_3`
C Triangulation_utils_3 | The class `Triangulation_utils_3` defines operations on the indices of vertices and neighbors within a cell
▼C TriangulationDataStructure_3 | 3D-triangulation data structures are meant to maintain the combinatorial information for 3D-geometric triangulations
C Cell | The concept `TriangulationDataStructure_3::Cell` stores four `Vertex_handle`s to its four vertices and four `Cell_handle`s to its four neighbors. The vertices are indexed 0, 1, 2, and 3 in consistent order. The neighbor indexed \( i\) lies opposite to vertex `i`
C Cell_data | Various algorithms using a triangulation data structure, such as Delaunay triangulations or Alpha Shapes, must be able to associate a state to a cell elemental. For efficiency, this information must be stored directly within the cell
C Vertex | The concept `TriangulationDataStructure_3::Vertex` represents the vertex class of a 3D-triangulation data structure. It must define the types and operations listed in this section. Some of these requirements are of geometric nature, they are optional when using the triangulation data structure class alone. They become compulsory when the triangulation data structure is used as a layer for the geometric triangulation class. (See Section Software Design.)
C TriangulationDSCellBase_3 |
C TriangulationDSVertexBase_3 |