Definition

A doubly-connected edge-list (Dcel for short) data-structure. It consists of three containers of records: vertices \( V\), halfedges \( E\), and faces \( F\). It maintains the incidence relation among them. The halfedges are ordered in pairs sometimes referred to as twins, such that each halfedge pair represent an edge.

A model of the GeneralPolygonSetDcel simply refines ArrangementDcel, the Halfedge and Face types being models of the concepts GeneralPolygonSetDcelHalfedge and GeneralPolygonSetDcelFace respectively

Refines: ArrangementDcel

Has Models:: CGAL::Gps_default_dcel<Traits>

See also: GeneralPolygonSetDcelFace; GeneralPolygonSetDcelHalfedge