Integrating Pre-Integration Into The Shear-Warp Algorithm

Simple item page
dc.contributor.authorSchulze, J.P.en_US
dc.contributor.authorKraus, M.en_US
dc.contributor.authorLang, U.en_US
dc.contributor.authorErtl, T.en_US
dc.contributor.editorI. Fujishiro and K. Mueller and A. Kaufmanen_US
dc.date.accessioned2014-01-29T17:38:36Z
dc.date.available2014-01-29T17:38:36Z
dc.date.issued2003en_US
dc.description.abstractThe shear-warp volume rendering algorithm is one of the fastest algorithms for volume rendering, but it achieves this rendering speed only by sacrificing interpolation between the slices of the volume data. Unfortunately, this restriction to bilinear interpolation within the slices severely compromises the resulting image quality. This paper presents the implementation of pre-integrated volume rendering in the shear-warp algorithm for parallel projection to overcome this drawback. A pre-integrated lookup table is used during compositing to perform a substantially improved interpolation between the voxels in two adjacent slices. We discuss the design and implementation of our extension of the shear-warp algorithm in detail. We also clarify the concept of opacity and color correction, and derive the required sampling rate of volume rendering with postclassi fication. Furthermore, the modified algorithm is compared to the traditional shear-warp rendering approach in terms of rendering speed and image quality.en_US
dc.description.seriesinformationVolume Graphicsen_US
dc.identifier.isbn1-58113-745-1en_US
dc.identifier.issn1727-8376en_US
dc.identifier.urihttps://doi.org/10.2312/VG/VG03/109-118en_US
dc.publisherThe Eurographics Associationen_US
dc.titleIntegrating Pre-Integration Into The Shear-Warp Algorithmen_US
Files
Collections
VG03: Third International Workshop on Volume Graphics 2003