 Doubly connected edge list

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.