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
Artikel, Zweitveröffentlichung, Verlagsversion
 | Es ist eine neuere Version dieses Eintrags verfügbar. |
Kurzbeschreibung (Abstract)
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×.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2024 |
| Autor(en): | Ströter, Daniel ; Mueller-Roemer, Johannes S. ; Stork, André ; Fellner, Dieter W. |
| Art des Eintrags: | Zweitveröffentlichung |
| Titel: | OLBVH: octree linear bounding volume hierarchy for volumetric meshes |
| Sprache: | Englisch |
| Publikationsjahr: | 30 April 2024 |
| Ort: | Darmstadt |
| Publikationsdatum der Erstveröffentlichung: | Oktober 2020 |
| Ort der Erstveröffentlichung: | Berlin ; Heidelberg |
| Verlag: | Springer |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | The Visual Computer : International Journal of Computer Graphics |
| Jahrgang/Volume einer Zeitschrift: | 36 |
| (Heft-)Nummer: | 10-12 |
| DOI: | 10.26083/tuprints-00023902 |
| URL / URN: | https://tuprints.ulb.tu-darmstadt.de/23902 |
| Zugehörige Links: | |
| Herkunft: | Zweitveröffentlichung DeepGreen |
| Kurzbeschreibung (Abstract): | 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×. |
| Freie Schlagworte: | Bounding volume hierarchy, GPGPU, Volumetric meshes, Direct volume rendering, Intersection detection, Slicing |
| Status: | Verlagsversion |
| URN: | urn:nbn:de:tuda-tuprints-239026 |
| Zusätzliche Informationen: | Special Issue: CGI'2020 Conference |
| Sachgruppe der Dewey Dezimalklassifikatin (DDC): | 000 Allgemeines, Informatik, Informationswissenschaft > 004 Informatik |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Graphisch-Interaktive Systeme 20 Fachbereich Informatik > Fraunhofer IGD |
| Hinterlegungsdatum: | 30 Apr 2024 11:14 |
| Letzte Änderung: | 13 Mai 2024 09:39 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
Verfügbare Versionen dieses Eintrags
- OLBVH: octree linear bounding volume hierarchy for volumetric meshes. (deposited 30 Apr 2024 11:14) [Gegenwärtig angezeigt]
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum