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

Full description

Bibliographic Details

Published in:	Computer graphics forum Vol. 29; no. 3; pp. 963 - 972
Main Authors:	Andrysco, Nathan, Tricoche, Xavier
Format:	Journal Article
Language:	English
Published:	Oxford, UK Blackwell Publishing Ltd 01.06.2010
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!