Doubly connected edge list
The doubly connected edge list (DCEL), also known as half-edge data structure, 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.
Wikipage redirect
primaryTopic
Doubly connected edge list
The doubly connected edge list (DCEL), also known as half-edge data structure, 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.
has abstract
Die Doubly-connected edge list ...... thmischen Geometrie verwendet.
@de
The doubly connected edge list ...... e disconnected graphs as well.
@en
Wikipage page ID
12,015,290
Wikipage revision ID
733,036,333
hypernym
type
comment
Die Doubly-connected edge list ...... thmischen Geometrie verwendet.
@de
The doubly connected edge list ...... a DCEL inside a bounding box.
@en
label
Doubly connected edge list
@en
Doubly-connected edge list
@de
