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...

Celý popis

Podrobná bibliografia

Vydané v:	Computer graphics forum Ročník 29; číslo 3; s. 963 - 972
Hlavní autori:	Andrysco, Nathan, Tricoche, Xavier
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford, UK Blackwell Publishing Ltd 01.06.2010
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!