 Doubly connected edge list

A mesh representation with two oppositely directed records per ordinary edge. Each record stores its origin vertex of a polyhedron, incident face, next face-boundary record and opposite record; previous records are often cached. The opposite record's origin gives the destination. This usage differs from a dangling half-edge of a graph.

A Doubly Connected Edge List (DCEL) is a data structure used to represent a planar graph, especially in computational geometry. It provides a way to efficiently store and manipulate the relationships between edges, vertices, and faces of a planar graph. ### Components of a DCEL A DCEL typically consists of the following components: 1. **Edge**: Each edge in the DCEL contains: - A reference to its starting vertex.