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)
“When, in the course of human events, it becomes necessary for one people to dissolve the political bands which have connected them with another, and to assume the powers of the earth, the separate and equal station to which the laws of nature and of nature’s God entitle them, a decent respect to the opinions of mankind requires that they should declare the causes which impel them to the separation.”
—Thomas Jefferson (1743–1826)
“Life is a travelling to the edge of knowledge, then a leap taken.”
—D.H. (David Herbert)
“Hey, you dress up our town very nicely. You don’t look out the Chamber of Commerce is going to list you in their publicity with the local attractions.”
—Robert M. Fresco, and Jack Arnold. Dr. Matt Hastings (John Agar)