Under CopyrightStröter, DanielDanielStröterMueller-Roemer, JohannesJohannesMueller-RoemerStork, AndréAndréStorkFellner, Dieter W.Dieter W.Fellner2022-03-0615.7.20202020https://publica.fraunhofer.de/handle/publica/26327910.24406/publica-r-26327910.1007/s00371-020-01886-6We 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×.enLead Topic- Visual Computing as a ServiceResearch Line- Computer graphics (CG)General Purpose Computation on Graphics Processing Unit (GPGPU)Volume renderingHierarchical bounding volumesHierarchical data structures006006journal article