Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Doubly- Connected Edge List
CHF 49.15
Auf Lager
SKU
S32VAEH2MB3
1 Verfügbar 
Geliefert zwischen Do., 29.01.2026 und Fr., 30.01.2026
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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). 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.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131265945
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H220mm x B220mm
- EAN 9786131265945
- Format Fachbuch
- Titel Doubly- Connected Edge List
- Herausgeber Betascript Publishing
- Anzahl Seiten 108
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
