Shear-Warp Deluxe: The Shear-Warp Algorithm Revisited
| dc.contributor.author | Sweeney, Jon | en_US |
| dc.contributor.author | Mueller, Klaus | en_US |
| dc.contributor.editor | D. Ebert and P. Brunet and I. Navazo | en_US |
| dc.date.accessioned | 2014-01-30T06:50:39Z | |
| dc.date.available | 2014-01-30T06:50:39Z | |
| dc.date.issued | 2002 | en_US |
| dc.description.abstract | Despite continued advances in volume rendering technology, the Shear-Warp algorithm, although conceived as early as 1994, still remains the world s fastest purely software-based volume rendering algorithm. The impressive speed of near double-digit framerates for moderately sized datasets, however, does come at the price of reduced image quality and memory consumption. In this paper, we present the implementation and impact of certain measures that seek to address these shortcomings. Specifically, we investigate the effects of: (i) post-interpolated classification and shading, (ii) matched volume sampling on zoom, (iii) the interpolation of intermediate slices to reduce inter-slice aliasing, and (iv) the re-use of encoded RLE runs for more than one major viewing direction to preserve memory. We also study a new variation of the shear-warp algorithm that operates on body-centered cubic grids. We find that the reduction of the number of voxels that this grid affords translates into direct savings in rendering times, with minimal degradation in image quality. | en_US |
| dc.description.seriesinformation | Eurographics / IEEE VGTC Symposium on Visualization | en_US |
| dc.identifier.isbn | 1-58113-536-X | en_US |
| dc.identifier.issn | 1727-5296 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/VisSym/VisSym02/095-104 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | Shear-Warp Deluxe: The Shear-Warp Algorithm Revisited | en_US |
Files
Original bundle
1 - 1 of 1