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

Definition

Inherits From

Creation

Access Functions

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

bool	v.is_at_infinity ()	checks whether the vertex lies at infinity and not associated with a point with bounded coordinates.
bool	v.is_isolated ()	checks whether the vertex is isolated (i.e., has no incident edges).
typename Dcel::Size	v.degree ()	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.
Boundary_type	v.boundary_in_x ()	returns whether the $$x-coordinate of the vertex is finite or whether it lies at $$ ± .
Boundary_type	v.boundary_in_y ()	returns whether the $$y-coordinate of the vertex is finite or whether it lies at $$ ± .
typename Traits::Point_2	v.point ()	returns the point associated with the vertex. Precondition:  v is not a vertex at infinity.