A Versatile and Efficient GPU Data Structure for Spatial Indexing

Jens Schneider, Peter Rautek

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


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 languageEnglish (US)
Pages (from-to)911-920
Number of pages10
JournalIEEE Transactions on Visualization and Computer Graphics
Issue number1
StatePublished - Aug 10 2016


Dive into the research topics of 'A Versatile and Efficient GPU Data Structure for Spatial Indexing'. Together they form a unique fingerprint.

Cite this