CGAL 5.1.3 - 2D Triangulation
TriangulationVertexBase_2 Concept Reference

## Definition

The concept TriangulationVertexBase_2 describes the requirements for the vertex base class of a triangulation data structure to be plugged in a basic, Delaunay or constrained triangulations.

The concept TriangulationVertexBase_2 refines the concept TriangulationDSVertexBase_2 adding geometric information: the vertex base of a triangulation stores a point.

Refines:
TriangulationDSVertexBase_2
Has Models:
CGAL::Triangulation_vertex_base_2<Traits,Vb>
TriangulationDataStructure_2
TriangulationDataStructure_2::Vertex
CGAL::Triangulation_vertex_base_2<Traits>

## Types

typedef unspecified_type Point
Must be the same as the point type TriangulationTraits_2::Point_2 defined by the geometric traits class of the triangulation.

## Creation

TriangulationVertexBase_2 (Point p)
constructs a vertex embedded in point p.

TriangulationVertexBase_2 (Point p, Face_handle f)
constructs a vertex embedded in point p and pointing on face f.

## Access Functions

Point point () const
returns the point.

## Setting

void set_point (Point p)
sets the point.

istream & operator>> (istream &is, TriangulationVertexBase_2 &v)
Inputs the non-combinatorial information given by the vertex: the point and other possible information.

ostream & operator<< (ostream &os, const TriangulationVertexBase_2 &v)
Outputs the non combinatorial operation given by the vertex: the point and other possible information.