TriangulationVertexBase

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

TriangulationVertexBase_3

Definition

The vertex base used by the geometric triangulation must store a point. So we list here the additional requirements compared to a vertex base usable for the triangulation data structure.

Refines

TriangulationDSVertexBase_3

Types

TriangulationVertexBase_3::Point
	Must be the same as the point type TriangulationTraits_3::Point_3 defined by the geometric traits class of the triangulation.

Creation

TriangulationVertexBase_3 v ( Point p);
Constructs a vertex whose geometric embedding is point p.

TriangulationVertexBase_3 v ( Point p, Cell_handle c);
Constructs a vertex embedding the point p and pointing to cell c.

Access Functions

Point v.point () Returns the point.

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 information given by the vertex: the point and other possible information.

Has Models

CGAL::Triangulation_vertex_base_3
CGAL::Triangulation_vertex_base_with_info_3
CGAL::Triangulation_hierarchy_vertex_base_3

TriangulationVertexBase_3 v ( Point p);
	Constructs a vertex whose geometric embedding is point p.
TriangulationVertexBase_3 v ( Point p, Cell_handle c);
	Constructs a vertex embedding the point p and pointing to cell c.

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 information given by the vertex: the point and other possible information.