Fast and Dynamic Construction of Bounding Volume Hierarchies Based on Loose Octrees

dc.contributor.authorGu, Fengen_US
dc.contributor.authorJendersie, Johannesen_US
dc.contributor.authorGrosch, Thorstenen_US
dc.contributor.editorBeck, Fabian and Dachsbacher, Carsten and Sadlo, Filipen_US
dc.date.accessioned2018-10-18T09:33:40Z
dc.date.available2018-10-18T09:33:40Z
dc.date.issued2018
dc.description.abstractMany fast methods for constructing BVHs on the GPU only use the centroids of primitive bounding boxes and ignore the actual spatial extent of each primitive. We present a fast new way and a memory-efficient implementation to build a BVH from a loose octree for real-time ray tracing on fully dynamic scenes. Our memory-efficient implementation is an in-place method and generalizes the state-of-the-art parallel construction for LBVH to build the BVH from nodes of different levels.en_US
dc.description.sectionheadersData Structures and Volumes
dc.description.seriesinformationVision, Modeling and Visualization
dc.identifier.doi10.2312/vmv.20181257
dc.identifier.isbn978-3-03868-072-7
dc.identifier.pages89-96
dc.identifier.urihttps://doi.org/10.2312/vmv.20181257
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/vmv20181257
dc.publisherThe Eurographics Associationen_US
dc.titleFast and Dynamic Construction of Bounding Volume Hierarchies Based on Loose Octreesen_US
Files
Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
089-096.pdf
Size:
2.19 MB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
supplementfinal.pdf
Size:
101.21 KB
Format:
Adobe Portable Document Format
Collections