TU Darmstadt / ULB / TUprints

OLBVH: octree linear bounding volume hierarchy for volumetric meshes

Ströter, Daniel ; Mueller-Roemer, Johannes S. ; Stork, André ; Fellner, Dieter W. (2024)
OLBVH: octree linear bounding volume hierarchy for volumetric meshes.
In: The Visual Computer : International Journal of Computer Graphics, 2020, 36 (10-12)
doi: 10.26083/tuprints-00023902
Article, Secondary publication, Publisher's Version

[img] Text
Copyright Information: CC BY 4.0 International - Creative Commons, Attribution.

Download (1MB)
Item Type: Article
Type of entry: Secondary publication
Title: OLBVH: octree linear bounding volume hierarchy for volumetric meshes
Language: English
Date: 30 April 2024
Place of Publication: Darmstadt
Year of primary publication: October 2020
Place of primary publication: Berlin ; Heidelberg
Publisher: Springer
Journal or Publication Title: The Visual Computer : International Journal of Computer Graphics
Volume of the journal: 36
Issue Number: 10-12
DOI: 10.26083/tuprints-00023902
Corresponding Links:
Origin: Secondary publication DeepGreen

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×.

Uncontrolled Keywords: Bounding volume hierarchy, GPGPU, Volumetric meshes, Direct volume rendering, Intersection detection, Slicing
Status: Publisher's Version
URN: urn:nbn:de:tuda-tuprints-239026
Additional Information:

Special Issue: CGI'2020 Conference

Classification DDC: 000 Generalities, computers, information > 004 Computer science
Divisions: 20 Department of Computer Science > Interactive Graphics Systems
20 Department of Computer Science > Fraunhofer IGD
Date Deposited: 30 Apr 2024 11:14
Last Modified: 30 Apr 2024 11:14
SWORD Depositor: Deep Green
URI: https://tuprints.ulb.tu-darmstadt.de/id/eprint/23902
Actions (login required)
View Item View Item