Linkless octree using multi-level perfect hashing

Myung Geol Choi, Eunjung Ju, Jung Woo Chang, Jehee Lee, Young J. Kim

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


The standard C/C++ implementation of a spatial partitioning data structure, such as octree and quadtree, is often inefficient in terms of storage requirements particularly when the memory overhead for maintaining parent-to-child pointers is significant with respect to the amount of actual data in each tree node. In this work, we present a novel data structure that implements uniform spatial partitioning without storing explicit parent-to-child pointer links. Our linkless tree encodes the storage locations of subdivided nodes using perfect hashing while retaining important properties of uniform spatial partitioning trees, such as coarse-to-fine hierarchical representation, efficient storage usage, and efficient random accessibility. We demonstrate the performance of our linkless trees using image compression and path planning examples.

Original languageEnglish
Pages (from-to)1773-1780
Number of pages8
JournalComputer Graphics Forum
Issue number7
StatePublished - Oct 2009


Dive into the research topics of 'Linkless octree using multi-level perfect hashing'. Together they form a unique fingerprint.

Cite this