Compressed Bounding Volume Hierarchies for Efficient Ray Tracing of Disperse Hair

Simple item page
dc.contributor.authorMartinek, Magdalenaen_US
dc.contributor.authorStamminger, Marcen_US
dc.contributor.authorBinder, Nikolausen_US
dc.contributor.authorKeller, Alexanderen_US
dc.contributor.editorBeck, Fabian and Dachsbacher, Carsten and Sadlo, Filipen_US
dc.date.accessioned2018-10-18T09:33:41Z
dc.date.available2018-10-18T09:33:41Z
dc.date.issued2018
dc.description.abstractRay traced human hair is becoming more and more ubiquitous in photorealistic image synthesis. Despite hierarchical data structures for accelerated ray tracing, performance suffers from the bad separability inherent with ensembles of hair strands. We propose a compressed acceleration data structure that improves separability by adaptively subdividing hair fibers. Compression is achieved by storing quantized as well as oriented bounding boxes and an indexing scheme to specify curve segments instead of storing them. We trade memory for speed, as our approach may use more memory, however, in cases of highly curved hair we can double the number of traversed rays per second over prior work. With equal memory we still achieve a speed-up of up to 30%, with equal performance we can reduce memory by up to 30%.en_US
dc.description.sectionheadersData Structures and Volumes
dc.description.seriesinformationVision, Modeling and Visualization
dc.identifier.doi10.2312/vmv.20181258
dc.identifier.isbn978-3-03868-072-7
dc.identifier.pages97-102
dc.identifier.urihttps://doi.org/10.2312/vmv.20181258
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/vmv20181258
dc.publisherThe Eurographics Associationen_US
dc.subjectComputing methodologies
dc.subjectRay tracing
dc.subjectParametric curve and surface models
dc.titleCompressed Bounding Volume Hierarchies for Efficient Ray Tracing of Disperse Hairen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
097-102.pdf
Size:
1.09 MB
Format:
Adobe Portable Document Format
Download
Collections
VMV18