OLBVH: octree linear bounding volume hierarchy for volumetric meshes

Daniel Ströter*, Johannes Mueller-Roemer, André Stork, Dieter W. Fellner

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We present a novel bounding volume hierarchy for GPU-accelerated direct volume rendering (DVR) as well as volumetric mesh slicing and inside-outside intersection testing. Our novel octree-based data structure is laid out linearly in memory using space filling Morton curves. As our new data structure results in tightly fitting bounding volumes, boundary markers can be associated with nodes in the hierarchy. These markers can be used to speed up all three use cases that we examine. In addition, our data structure is memory-efficient, reducing memory consumption by up to 75%. Tree depth and memory consumption can be controlled using a parameterized heuristic during construction. This allows for significantly shorter construction times compared to the state of the art. For GPU-accelerated DVR, we achieve performance gain of 8.4× –13×. For 3D printing, we present an efficient conservative slicing method that results in a 3× –25× speedup when using our data structure. Furthermore, we improve volumetric mesh intersection testing speed by 5× –52×.

Original languageEnglish
Pages (from-to)2327-2340
Number of pages14
JournalThe Visual Computer
Issue number10-12
Publication statusPublished - 2020

Fields of Expertise

  • Information, Communication & Computing

Cite this