TriangulationVertexBase

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

TriangulationVertexBase_2

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

Types

TriangulationVertexBase_2::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 v ( Point p);
constructs a vertex embedded in point p.

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

Access Functions

Point	v.point ()	returns the point.
void*	v.face ()	returns a pointer to an incident face.

Setting

void	v.set_point ( Point p)
		sets the point.

I/O

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

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

Has Models

CGAL::TriangulationVertexBase_2<Traits>.

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

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

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

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