Abstract
In this paper we present a novel GPU-based data structure for spatial indexing. Based on Fenwick trees—a special type of binary indexed trees—our data structure allows construction in linear time. Updates and prefixes can be computed in logarithmic time, whereas point queries require only constant time on average. Unlike competing data structures such as summed-area tables and spatial hashing, our data structure requires a constant amount of bits for each data element, and it offers unconstrained point queries. This property makes our data structure ideally suited for applications requiring unconstrained indexing of large data, such as block-storage of large and block-sparse volumes. Finally, we provide asymptotic bounds on both run-time and memory requirements, and we show applications for which our new data structure is useful.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 911-920 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Visualization and Computer Graphics |
| Volume | 23 |
| Issue number | 1 |
| DOIs | |
| State | Published - Aug 10 2016 |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01Acknowledgements: The authors’ work is funded by the Visual Computing Center (VCC) at King Abdullah University of Science and Technology (KAUST). Volume data sets were obtained from VolVis.org, TU Wien, and Digi-Morph. The vessel data set was provided by John Keyser, TAMU.