Questions tagged [doubly-connected-edge-list]
A doubly-connected edge list (DCEL) is an edge-centered data structure capable of maintaining incidence information of vertices, edges and faces, for example for planar maps.
1
question
12
votes
1answer
10k views
How do I construct a doubly connected edge list given a set of line segments?
For a given planar graph $G(V,E)$ embedded in the plane, defined by a set of line segments $E= \left \{ e_1,...,e_m \right \} $, each segment $e_i$ is represented by its endpoints $\left \{ L_i,R_i \...
