Matrix Trees
| dc.contributor.author | Andrysco, Nathan | en_US |
| dc.contributor.author | Tricoche, Xavier | en_US |
| dc.contributor.editor | G. Melancon, T. Munzner, and D. Weiskopf | en_US |
| dc.date.accessioned | 2014-02-21T20:06:01Z | |
| dc.date.available | 2014-02-21T20:06:01Z | |
| dc.date.issued | 2010 | en_US |
| dc.description.abstract | 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 the height of the tree increases. Pointerbased trees require memory consumption proportional to the number of tree nodes, thus exploiting the typical sparsity of large trees. Yet, their traversal is slowed by the need to follow explicit pointers across the different levels. Our solution is a pointerless approach that represents each tree level with its own matrix, as opposed to traditional pointerless trees that use only a single vector. This novel data organization allows us to fully exploit the tree s regular structure and improve the performance of tree operations. By using a sparse matrix data structure we obtain a representation that is suited for sparse and dense trees alike. In particular, it uses less total memory than pointer-based trees even when the data set is extremely sparse. We show how our approach is easily implemented on the GPU and illustrate its performance in typical visualization scenarios. | en_US |
| dc.description.number | 3 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 29 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.2009.01709.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2009.01709.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Matrix Trees | en_US |