Navigation: Up   Table of Contents   Package Overview   Bibliography   Index   Title   Acknowledging CGAL

CGAL::Arrangement_2<Traits,Dcel>::Vertex

Definition

An object v of the class Arrangement_2<Traits,Dcel>::Vertex represents an arrangement vertex, that is - a 0-dimensional cell, associated with a point on the plane.

Inherits From

typename Dcel::Vertex

Creation

Arrangement_2<Traits,Dcel>::Vertex v;
default constructor.

Access Functions

All non-const methods listed below also have const counterparts that return constant handles, iterators or circulators:

bool v.is_at_open_boundary () const checks whether the vertex lies at infinity and not associated with a point with bounded coordinates.

bool v.is_isolated () const checks whether the vertex is isolated (i.e., has no incident edges).

typename Dcel::Size v.degree () const returns the number of edges incident to v.

Halfedge_around_vertex_circulator v.incident_halfedges () returns a circulator circulator that allows going over the halfedges incident to v (that have v as their target). The edges are traversed in a clockwise direction around v.
Precondition: v is not an isolated vertex.

Face_handle v.face () returns a handle to the face that contains v in its interior.
Precondition: v is an isolated vertex.

typename Traits::Point_2 v.point () const returns the point associated with the vertex.
Precondition: v is not a vertex at infinity.

Arr_parameter_space v.parameter_space_in_x () const returns the placement of the x-coordinate in the parameter space, that is, either the left boundary-side, the interior, or the right boundary-side.

Arr_parameter_space v.parameter_space_in_y () const returns the placement of the y-coordinate in the parameter space, that is, either the bottom boundary-side, the interior, or the top boundary-side.

Next: Arrangement_2<Traits,Dcel>::Halfedge
Navigation: Up   Table of Contents   Package Overview   Bibliography   Index   Title   Acknowledging CGAL
CGAL Open Source Project. Release 3.9. 26 September 2011.