A vertex record in a Dcel data structure. A vertex is always associated with a point. However, the vertex record only stores a pointer to the associated point, and the actual Point object is stored elsewhere.
A vertex usually has several halfedges incident to it, such that it is possible to access one of these halfedges directly and to traverse all incident halfedges around the vertex. However, the Dcel may also contain isolated vertices that have no incident halfedges. In this case, the vertex stores an isolated vertex-information record, indicating the face that contains this vertex in its interior.
ArrangementDcelVertex v; | |
default constructor.
|
void | v.assign ( Self other) | assigns v with the contents of the other vertex. |
All functions below also have const counterparts, returning non-mutable pointers or references:
void | v.set_halfedge ( Halfedge* e) | sets the incident halfedge, marking v as a regular vertex. | ||
void | v.set_isolated_vertex ( Isolated_vertex* iv) | |||
sets the isolated vertex-information record, marking v as an isolated vertex. | ||||
void | v.set_point ( Point* p) | sets the associated point. | ||
void | v.set_boundary ( Arr_parameter_space inf_x, Arr_parameter_space inf_y) | |||
sets v as a vertex on a boundary side.
|
ArrangementDcel
ArrangementDcelHalfedge
ArrangementDcelIsolatedVertex