dc.contributor.author | Yang, Chuan-Kai | en_US |
dc.contributor.author | Chiueh, Tzi-cker | en_US |
dc.contributor.editor | David S. Ebert and Jean M. Favre and Ronald Peikert | en_US |
dc.date.accessioned | 2014-01-30T06:46:01Z | |
dc.date.available | 2014-01-30T06:46:01Z | |
dc.date.issued | 2001 | en_US |
dc.identifier.isbn | 3-211-83674-8 | en_US |
dc.identifier.issn | 1727-5296 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/VisSym/VisSym01/263-272 | en_US |
dc.description.abstract | Most existing volume rendering algorithms assume that data sets are memory-resident and thus ignore the performance overhead of disk I/O. While this assumption may be true for high-performance graphics machines, it does not hold for most desktop personal workstations. To minimize the end-to-end volume rendering time, this work re-examines implementation strategies of the ray casting algorithm, taking into account both computation and I/O overheads. Specifically, we developed a data-driven execution model for ray casting that achieves the maximum overlap between rendering computation and disk I/O. Together with other performance optimizations, on a 300-MHz Pentium-II machine, without directional shading, our implementation is able to render a 128x128 greyscale image from a 128x128x128 data set with an average end-to-end delay of 1 second, which is very close to the memory-resident rendering time. With a little modification, this work can also be extended to do out-of-core visualization as well. | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.title | I/O-Conscious Volume Rendering | en_US |
dc.description.seriesinformation | Eurographics / IEEE VGTC Symposium on Visualization | en_US |