CGAL Basic Library Reference Manual: Triangulation_vertex

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

Definition

The vertex stores a point and gives access to an incident face of maximal dimension.

#include <CGAL/Triangulation_vertex_3.h>

Inherits From

Tds::Vertex

Types

The class Triangulation_vertex_3<Traits,Tds> defines the following types, also defined in the class Triangulation_3<Traits,Tds>:

typedef Traits::Point
Point; point type

Triangulation_vertex_3<Traits,Tds>::Vertex_handle
handle to a vertex

Triangulation_vertex_3<Traits,Tds>::Cell_handle
handle to a cell

begin of advanced section

Creation

The user needs to construct vertices explicitly only when implementing his own triangulation algorithms. If he uses the standard ways proposed by CGAL to construct a triangulation, he does not need the following constructors.

Triangulation_vertex_3<Traits,Tds> v;
Introduces a new vertex. The geometric information is initialized by the default constructor of the class Point. A test on the handle to the incident cell of v for equality with NULL will answer true.

Triangulation_vertex_3<Traits,Tds> v ( Point p);
Introduces vertex v, and initializes its geometric information. A test on the handle to the incident cell of v for equality with NULL will answer true.

Triangulation_vertex_3<Traits,Tds> v ( Point p, Cell_handle c);
Introduces vertex v, and initializes the geometric information and the handle to the incident cell.

Triangulation_vertex_3<Traits,Tds> v ( Cell_handle c);
Introduces vertex v, and initializes the handle to the incident cell.

Setting

void	v.set_cell ( Cell_handle c)
		Sets v's cell to c

void	v.set_point ( Point p)
		Sets v's point to p

end of advanced section

Access Functions

Point v.point () Returns the geometric information of v.

Cell_handle v.cell () Finds a cell of the triangulation having v as vertex. Remember that in degenerate dimensions, a cell stores a face of maximal dimension (Section ).

Vertex_handle v.handle () Returns a handle to the vertex.

Next: Class declaration of Triangulation_cell_3<Traits,Tds>

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

The GALIA project. Jan 18, 2000.

Triangulation_vertex_3<Traits,Tds>::Vertex_handle
	handle to a vertex
Triangulation_vertex_3<Traits,Tds>::Cell_handle
	handle to a cell

Triangulation_vertex_3<Traits,Tds> v;
	Introduces a new vertex. The geometric information is initialized by the default constructor of the class Point. A test on the handle to the incident cell of v for equality with NULL will answer true.

Triangulation_vertex_3<Traits,Tds> v ( Point p);
	Introduces vertex v, and initializes its geometric information. A test on the handle to the incident cell of v for equality with NULL will answer true.

Triangulation_vertex_3<Traits,Tds> v ( Point p, Cell_handle c);
	Introduces vertex v, and initializes the geometric information and the handle to the incident cell.

Triangulation_vertex_3<Traits,Tds> v ( Cell_handle c);
	Introduces vertex v, and initializes the handle to the incident cell.

Point	v.point ()	Returns the geometric information of v.

Cell_handle	v.cell ()	Finds a cell of the triangulation having v as vertex. Remember that in degenerate dimensions, a cell stores a face of maximal dimension (Section ).

Vertex_handle	v.handle ()	Returns a handle to the vertex.