Show simple item record

dc.contributor.authorBajaj, Chandrajiten_US
dc.contributor.authorIhm, Insungen_US
dc.contributor.authorKoo, Gee-bumen_US
dc.contributor.authorPark, Sanghunen_US
dc.contributor.editorGröller, E., Löffelmann, H., Ribarsky, W.en_US
dc.date.accessioned2015-11-16T13:39:49Z
dc.date.available2015-11-16T13:39:49Z
dc.date.issued1999en_US
dc.identifier.isbn978-3-7091-6803-5en_US
dc.identifier.issnEG: 1727-5296en_US
dc.identifier.issnSpringer: 0946-2767en_US
dc.identifier.urihttp://dx.doi.org/10.2312/vissym19991015en_US
dc.description.abstractThis paper proposes a new parallel ray-casting scheme for very large volume data on distributed-memory architectures. Our method, based on data compression, attempts to enhance the speedup of parallel rendering by quickly reconstructing data from local memory rather than expensively fetching them from remote memory spaces. Furthermore, it takes the advantages of both object-order and image-order traversal algorithms: It exploits object-space and image-space coherence, respectively, by traversing a min-max octrce block-wise and using a runtime quadtree which is maintained dynamically against pixels' opacity values. Our compression-based parallel volume rendering scheme minimizes conmUnications between processing elements during rendering, hence is also very appropriate for more practical distributed systems, such as dusters of PCs and/or workstations, in which data conmlUnications between processors are regarded as quite costly. We report experimental results on a Cray T3E for the Visible Man dataset.en_US
dc.publisherSpringer and The Eurographics Associationen_US
dc.titleParallel Ray Casting of Visible Human on Distributed Memory Architecturesen_US
dc.description.seriesinformationVisSym99: Joint Eurographics - IEEE TCVG Symposium on Visualizationen_US
dc.description.sectionheadersPapersen_US
dc.identifier.doi10.2312/vissym19991015en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record