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 provides 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 subdivisions of the plane, commonly called planar straight-line graphs (PSLG). For example, a Voronoi diagram is commonly represented by a DCEL inside a bounding box.
This data structure was originally suggested by Muller and Preparata 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.
Read more about Doubly Connected Edge List: Data Structure
Famous quotes containing the words doubly, connected, edge and/or list:
“For the most part, we are not where we are, but in a false position. Through an infirmity of our natures, we suppose a case, and put ourselves into it, and hence are in two cases at the same time, and it is doubly difficult to get out.”
—Henry David Thoreau (1817–1862)
“Before I had my first child, I never really looked forward in anticipation to the future. As I watched my son grow and learn, I began to imagine the world this generation of children would live in. I thought of the children they would have, and of their children. I felt connected to life both before my time and beyond it. Children are our link to future generations that we will never see.”
—Louise Hart (20th century)
“A whisper ran along the edge of the dawn.”
—Zora Neale Hurston (1891–1960)
“Weigh what loss your honor may sustain
If with too credent ear you list his songs,
Or lose your heart, or your chaste treasure open
To his unmastered importunity.”
—William Shakespeare (1564–1616)