Navigation: Up, Table of Contents, Bibliography, Index, Title Page

At the bottom level, a vertex provides access to one of its incident cells through a void* pointer. It can also optionally store a point. The information about the point is in fact not used by the triangulation data structure class provided by CGAL and is therefore only optional when this triangulation data structure class is used alone. It becomes compulsory when the triangulation data structure is used as a layer for the geometric triangulation class. (See Section reference.)

Types

Vertex_base::Point
Must be the same as the point type Traits::Point defined by the geometric traits class of the triangulation. Optional for the triangulation data structure alone.

Creation

Vertex_base v;
Default constructor

Vertex_base v ( Point p);
Constructs a vertex whose geometric emdedding is point p. Optional for the triangulation data structure alone.

Vertex_base v ( Point p, void* c);
Constructs a vertex emdedded in point p and pointing to cell c. Optional for the triangulation data structure alone.

Vertex_base v ( void* c);
Constructs a vertex pointing to cell c.

Access Functions

Point v.point () Returns the point. Optional for the triangulation data structure alone.
void* v.cell () Returns the pointer to an incident cell

Setting

void v.set_point ( Point p)
Sets the point. Optional for the triangulation data structure alone.
void v.set_cell ( void* c)
Sets the incident cell.

Checking

bool v.is_valid ( bool verbose=false)
Performs any desired geometric test on a vertex. Checks that the pointer to an incident cell is not NULL.

I/O

istream& istream& is >> & v
Inputs the non-combinatorial information given by the vertex: the optional point and other possible information.

ostream& ostream& os << v Outputs the non combinatorial operation given by the vertex: the optional point and other possible information.

Next: Class declaration of Cell_base
Navigation: Up, Table of Contents, Bibliography, Index, Title Page
The GALIA project. Jan 18, 2000.