Show simple item record

dc.contributor.authorMarchesin, Stéphaneen_US
dc.contributor.authorMa, Kwan-Liuen_US
dc.contributor.editorJames Ahrens and Kurt Debattista and Renato Pajarolaen_US
dc.date.accessioned2014-01-26T16:53:10Z
dc.date.available2014-01-26T16:53:10Z
dc.date.issued2010en_US
dc.identifier.isbn978-3-905674-21-7en_US
dc.identifier.issn1727-348Xen_US
dc.identifier.urihttp://dx.doi.org/10.2312/EGPGV/EGPGV10/011-018en_US
dc.description.abstractIn the field of parallel volume rendering, occlusion is a concept which is already widely exploited in order to improve performance. However, when one moves to larger datasets the use of parallelism becomes a necessity, and in that context, exploiting occlusion to speed up volume rendering is not straightforward. In this paper, we propose and detail a new scheme in which the processors exchange occlusion information so as to speed up the rendering by discarding invisible areas. Our pipeline uses full floating point accuracy for all the intermediate stages, allowing the production of high quality pictures.We further show comprehensive performance results using this pipeline with multiple datasets and demonstrate that cross-processor occlusion can improve the performance of parallel volume rendering.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleCross-Node Occlusion in Sort-Last Volume Renderingen_US
dc.description.seriesinformationEurographics Symposium on Parallel Graphics and Visualizationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record