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

CGAL::Topological_map<Dcel>::Vertex

Definition

An object v of the class Topological_map<Dcel>::Vertex is a vertex of a topological map.

Inherits From

Dcel::Vertex

Creation

Topological_map<Dcel>::Vertex v;
default constructor.

Access Functions

Halfedge_around_vertex_circulator
v.incident_halfedges ()
returns a circulator that allows to traverse the halfedges that have v as their target. The edges are traversed around v in an order opposite that of the Ccb_halfedge_circulator. This circulator can also be used to access incident faces and vertices.

Predicates

bool v.is_incident_edge ( Halfedge_const_handle e)
returns true if e is incident to v (i.e., if v is the source or the target of e).
bool v.is_incident_face ( Face_const_handle f)
returns true if f is incident to v.

Query Functions

unsigned int v.degree () returns the degree of v i.e., the number of outgoing halfedges.

Next: Topological_map<Dcel>::Halfedge
Navigation: Table of Contents, Bibliography, Index, Title Page
The CGAL Project . Tue, December 21, 2004 .