\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 5.0 - 2D Arrangements
List of all members
ArrangementDcelHole 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::Hole_iterator Hole_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.
 
Hole_iterator iterator ()
 returns an iterator for the hole.
 

Modifiers

void set_face (Face *f)
 sets the incident face.
 
void set_iterator (Hole_iterator it)
 sets the hole iterator.