"Fossies" - the Fresh Open Source Software Archive

Member "doc_html/TDS_3/annotated.html" (8 Nov 2019, 14717 Bytes) of package /linux/misc/CGAL-5.0-doc_html.tar.xz:


Caution: In this restricted "Fossies" environment the current HTML page may not be correctly presentated and may have some non-functional links. You can here alternatively try to browse the pure source code or just view or download the uninterpreted raw source code. If the rendering is insufficient you may try to find and view the page on the project site itself.

\( \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 5.0 - 3D Triangulation Data Structure
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
 CTriangulation_data_structure_3The 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)
 CTriangulation_ds_cell_base_3The class Triangulation_ds_cell_base_3<> is a model for the concept TriangulationDSCellBase_3 to be used by Triangulation_data_structure_3
 CTriangulation_ds_vertex_base_3The 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
 CTriangulation_utils_3The class Triangulation_utils_3 defines operations on the indices of vertices and neighbors within a cell
 CTriangulationDataStructure_33D-triangulation data structures are meant to maintain the combinatorial information for 3D-geometric triangulations
 CCellThe concept TriangulationDataStructure_3::Cell stores four Vertex_handles to its four vertices and four Cell_handles 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
 CVertexThe 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.)
 CTriangulationDSCellBase_3At the base level (see the Software Design sections of the Chapters Triangulation and Triangulation Datastructure), a cell stores handles to its four vertices and to its four neighbor cells. The vertices and neighbors are indexed 0, 1, 2 and 3. Neighbor i lies opposite to vertex i
 CTriangulationDSVertexBase_3At the bottom level of 3D-triangulations (see Sections Software Design and Software Design), a vertex provides access to one of its incident cells through a handle