Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00341479n
Noun Concept
Categories: Graph data structures, Geometric data structures, Geometric graph theory
EN
doubly connected edge list  DCEL  Doubly-connected edge list  half-edge data structure  Half-edge mesh
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
Definitions
Relations
Sources
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
IS A
list
Wikipedia
EN
doubly connected edge list
Wikidata
EN
doubly connected edge list
Wikipedia Redirections
EN
DCEL, Doubly-connected edge list, Half-edge data structure, Half-edge mesh
Wikidata Alias
EN
DCEL, half-edge data structure

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License