A face record in a Dcel data structure. A face may either be unbounded, otherwise it has an incident halfedge along the chain defining its outer boundary. A face may also contain holes and isolated vertices in its interior.
| |
the corresponding Dcel vertex type.
| |
| |
the corresponding Dcel halfedge type.
| |
| |
a bidirectional iterator over the holes in
inside the face. Its value-type is Halfedge*.
| |
| |
a bidirectional iterator over the
isolated vertices in inside the face. Its value-type is Vertex*.
|
The non-mutable iterators Hole_const_iterator, and Isolated_vertex_const_iterator are also defined.
| |
default constructor.
|
|
| assigns f with the contents of the other face. |
All functions below also have const counterparts, returning non-mutable pointers or iterators:
ArrangementDcel
ArrangementDcelVertex
ArrangementDcelHalfedge