Memory Efficient Parallel Ray-casting Algorithm for Unstructured Grid Volume Rendering

dc.contributor.authorKim, Duksuen_US
dc.contributor.editorAnna Puig Puig and Tobias Isenbergen_US
dc.date.accessioned2017-06-12T05:17:50Z
dc.date.available2017-06-12T05:17:50Z
dc.date.issued2017
dc.description.abstractWe propose a novel memory efficient parallel ray casting algorithm for unstructured grid. To reduce the high memory consumption of a previous work (i.e. Bunyk), we use a small size of local buffer for each thread to keep view dependent information for most recently visited faces. To improve the utilization efficiency of a local buffer, we propose an index-based hash function and a novel group traversal scheme. With our method, a small size buffer achieves a high hit ratio (i.e. utilization efficiency). As a result, we achieved a compatible performance with Bunyk while using less than 1% of memory space for view dependent face information. Also, our method shows even better performance than Bunyk for a large dataset since the buffer size is small enough to utilize CPU caches and our traversal scheme maximally takes advantage of the early ray termination optimization.en_US
dc.description.sectionheadersPosters
dc.description.seriesinformationEuroVis 2017 - Posters
dc.identifier.doi10.2312/eurp.20171157
dc.identifier.isbn978-3-03868-044-4
dc.identifier.pages13-15
dc.identifier.urihttps://doi.org/10.2312/eurp.20171157
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/eurp20171157
dc.publisherThe Eurographics Associationen_US
dc.titleMemory Efficient Parallel Ray-casting Algorithm for Unstructured Grid Volume Renderingen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
013-015.pdf
Size:
488.37 KB
Format:
Adobe Portable Document Format