Matrix Trees

We propose a new data representation for octrees and kd‐trees that improves upon memory size and algorithm speed of existing techniques. While pointerless approaches exploit the regular structure of the tree to facilitate efficient data access, their memory footprint becomes prohibitively large as t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computer graphics forum Jg. 29; H. 3; S. 963 - 972
Hauptverfasser:	Andrysco, Nathan, Tricoche, Xavier
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford, UK Blackwell Publishing Ltd 01.06.2010
Schlagworte:	Algorithms C (programming language) Computer graphics Computer Graphics [I.3.5]: Object hierarchies Computer Graphics [I.3.6]: Methodology and Techniques-Graphics data structures and data types Footprints Mathematical analysis Matrix Octrees Representations Sparsity Studies Trees Vectors (mathematics) Visualization
ISSN:	0167-7055, 1467-8659
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!