CGAL 5.6.3 - 2D Arrangements

Loading...
Searching...
No Matches
List of all members
ArrangementDcelOuterCcb Concept Reference
2D Arrangement Reference » Concepts » DCEL Concepts

## Definition

A hole record in a DCEL data structure, which stores the face that contains the hole in its interior, along with an iterator for the hole in the holes' container of this face.

See also
  `ArrangementDcel`
  `ArrangementDcelFace`

## Types
typedef unspecified_type | Face
| the corresponding DCEL face type.
typedef Face::OuterCcb_iterator | OuterCcb_iterator

## Creation
| Arr_dcel_hole ()
| default constructor.

## Access Functions
All functions below also have `const` counterparts, returning non-mutable pointers or iterators:
Face * | face ()
| returns the incident face, which contains `ho` in its interior.
OuterCcb_iterator | iterator ()
| returns an iterator for the hole.

## Modifiers
void | set_face (Face *f)
| sets the incident face.
void | set_iterator (OuterCcb_iterator it)
| sets the hole iterator.