"Fossies" - the Fresh Open Source Software Archive

Member "doc_html/TDS_2/annotated.html" (8 Nov 2019, 14830 Bytes) of package /linux/misc/CGAL-4.14.2-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 CGAL-4.14.2-doc_html.tar.xz 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 4.14.2 - 2D 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_2The class Triangulation_data_structure_2 is a model for the TriangulationDataStructure_2 concept
 CTriangulation_ds_face_base_2The class Triangulation_ds_face_base_2 is a model for the concept TriangulationDSFaceBase_2 to be used by Triangulation_data_structure_2
 CTriangulation_ds_vertex_base_2The class Triangulation_ds_vertex_base_2 can be used as the base vertex for a Triangulation_data_structure_2, it is a model of the concept TriangulationDSVertexBase_2
 CTriangulationDataStructure_2The concept TriangulationDataStructure_2 describes the requirements for the second template parameter of the basic triangulation class Triangulation_2<Traits,Tds> and of all other 2D triangulation classes
 CFaceThe concept TriangulationDataStructure_2::Face describes the types used to store the faces face class of a TriangulationDataStructure_2. A TriangulationDataStructure_2::Face stores three handles to its three vertices and three handles to its three neighbors. The vertices are indexed 0,1, and 2 in counterclockwise order. The neighbor indexed i lies opposite to vertex i
 CVertexThe concept TriangulationDataStructure_2::Vertex describes the type used by a TriangulationDataStructure_2 to store the vertices
 CTriangulationDSFaceBase_2The concept TriangulationDSFaceBase_2 describes the requirements for the face base class of a CGAL::Triangulation_data_structure_2<Vb,Fb>
 CTriangulationDSVertexBase_2The concept TriangulationDSVertexBase_2 describes the requirements for the vertex base class of a CGAL::Triangulation_data_structure_2<Vb,Fb>