Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00341479n
Noun Concept
SYL
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
IS A
EN
list

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