bn:00341479n
Noun Concept
AR
No term available
EN
The doubly connected edge list, 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. Wikipedia
Relations
Sources