Fast Volume Rotation using Binary Shear-Warp Factorization
This paper presents a fast volume rotation technique based on binary shear-warp factorization. Unlike many acceleration algorithms this method does not trade image quality for speed and does not require any specialized hardware either. In order to skip precisely the empty regions along the rays to be evaluated a binary volume is generated indicating the locations of the transparent cells. This mask is rotated by an incremental binary shear transformation, executing bitwise boolean operations on integers storing the bits of the binary volume. The ray casting is accelerated using the transformed mask and an appropriate lookup-table technique for finding the first non-transparent cell along each ray.
KeywordsTransfer Function Lookup Table Volume Rendering Volume Visualization Empty Region
Unable to display preview. Download preview PDF.
- 1.Daniel Cohen-Or and Shachar Fleishman. An incremental alignment algorithm for parallel volume rendering. Computer Graphics Forum (EUROGRAPHICS ‘85 Proceedings), pages 123–133, 1995.Google Scholar
- 2.John Denskin and Pat Hanrahan. Fast algorithms for volume ray tracing. Workshop on Volume Visualization, pages 91–98, 1992.Google Scholar
- 4.Jürgen Hesser, Reinhard Männer, Günter Knittel, Wolfgang Strasser, Hanspeter Pfister and Arie Kaufman. Three architectures for volume rendering. Computer Graphics Forum (EUROGRAPHICS ‘85 Proceedings), pages 111–122, 1995.Google Scholar
- 5.Philippe Lacroute and Marc Levoy. Fast volume rendering using a shear-warp factorization of the viewing transformation. Computer Graphics (SIGGRAPH ‘84 Proceedings), pages 451–457, 1994.Google Scholar
- 6.David Laur and Pat Hanrahan. Hierarchical splatting: A progressive refinement algorithm for volume rendering. Computer Graphics (SIGGRAPH ‘81 Proceedings), pages 285–288, 1991.Google Scholar
- 9.Derek R. Ney, Elliot K. Fishman, Donna Magid and Marc Levoy. Computed tomography data: Principles and techniques. IEEE Computer Graphics and Application, 8, 1988.Google Scholar
- 10.Peter Schröder and Gordon Stoll. Data parallel volume rendering as line drawing. Workshop on Volume Visualization, pages 25–32, 1992.Google Scholar
- 11.K.R. Subramanian and Donald S. Fussell. Applying space subdivision techniques to volume rendering. IEEE Visualization ‘80, pages 150–159, 1990.Google Scholar
- 13.Guy Vézina, Peter A. Fletcher and Philip K. Robertson. Volume rendering on the maspar mp-1. Workshop on Volume Visualization, pages 3–8, 1992.Google Scholar
- 14.Jason Freund and Kenneth Sloan. Accelerated volume rendering using homogeneous region encoding. IEEE Visualization ‘87, pages 191–196, 1997.Google Scholar
- 15.D. Cohen and Z. Shefer. Proximity clouds - an acceleration technique for 3D grid traversal. TR FC93–01, Ben Gurion University, Israel, 1993.Google Scholar
- 16.K. Zuiderveld, A. Koning, Viergever and A. Max. Acceleration of ray casting using 3D distance transformation. Visualization in Biomedical Computing, pages 324–335, 1992.Google Scholar
- 17.Jae-jeong Choi and Yeong Gil Shin. Efficient Image-Based Rendering of Volume Data. TR http://cglab.snu.ac.kr/jjchoi/ibr.html, Seoul National University, Korea, 1998.
- 18.Björn Gudmundsson and Michael Randén. Incremental generation of projections of CT-volumes. In First Conf. on Visualization in Biomedical Computing, Atlanta,1990.Google Scholar