Navigation:
Up,
Table of Contents,
Bibliography,
Index,
Title Page
2D Triangulation Data Structure
Definition
The triangulation data structure can be seen as a container
for the faces and vertices of a triangulation. This class takes care
of all combinatorial operation of the triangulation.
CGAL offers two models for the concept
TriangulationDataStructure_2.
Each of those models is templated by the base classes for the faces
and vertices of the triangulation.
Concepts
TriangulationDataStructure_2
TriangulationDataStructure_2::Face
TriangulationDataStructure_2::Vertex
TriangulationFaceBase_2
TriangulationVertexBase_2
ConstrainedTriangulationFaceBase_2
RegularTriangulationFaceBase_2
Classes
CGAL::Triangulation_data_structure_using_list_2<Vb,Fb>
CGAL::Triangulation_default_data_structure_2<Traits,Vb,Fb>
CGAL::Triangulation_face_base_2<Traits>
CGAL::Triangulation_vertex_base_2<Traits>
CGAL::Regular_triangulation_face_base_2<Traits>
CGAL::Constrained_triangulation_face_base_2<Traits>
Links to the Reference Sections
Navigation:
Up,
Table of Contents,
Bibliography,
Index,
Title Page
www.cgal.org. Aug 13, 2001.