\( \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.9 - 2D Triangulation
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
TriangulationHierarchyVertexBase_2 Concept Reference
Concepts

Definition

The vertex of a triangulation included in a triangulation hierarchy has to provide some pointers to the corresponding vertices in the triangulations of the next and preceding levels. Therefore, the concept TriangulationHierarchyVertexBase_2 refines the concept TriangulationVertexBase_2, adding handles to the corresponding vertices in the next and previous level triangulations.

Refines:
TriangulationVertexBase_2
Has Models:
CGAL::Triangulation_hierarchy_vertex_base_2<Vb>
See Also
CGAL::Triangulation_hierarchy_2<Tr>

Operations

Vertex_handle up ()
 returns the corresponding vertex (if any) of the next level triangulation.
 
Vertex_handle down ()
 returns the corresponding vertex of the previous level triangulation.
 
void set_up (Vertex_handle u)
 sets the handle pointing to to the corresponding vertex of the next level triangulation.
 
void set_down (Vertex_handle d)
 sets the handle pointing to the corresponding vertex of the previous level triangulation.