Doubly-connected edge list
From Wikipedia, the free encyclopedia
The doubly-connected edge list (DCEL) is a data structure to represent an embedding of a planar graph in the plane and polytopes in 3D. This data structure provide efficient manipulation of the topological information associated with the objects in question (vertices, edges, faces). It is used in many algorithms of computational geometry to handle polygonal subivisions of the plane, commonly called planar straight-line graphs (PSLG).[1]
This data structure was originally suggested by Muller and Preparata [2] for representations of 3D convex polyhedra.
Later a somewhat different data structuring was suggested, but the name "DCEL" was retained.
For simplicity, only connected graphs are considered, however the DCEL structure may be extended to handle disconnected graphs as well.
[edit] References
- ^ DCELs may be found in all major books in computational geometry.
- ^ Muller, D. E. ; Preparata, F. P. "Finding the Intersection of Two Convex Polyhedra", Tech. Rept. UIUC, 1977, 38pp, also Theoretical Computer Science", Vol. 7, 1978, 217-236
