Fast rotation of volume data on parallel architectures
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
An algorithm for rendering of orthographic views of volume data on data-parallel computer architectures is described. In particular, the problem or rotating the volume in regard to the communication overhead associated with finely distributed memory is analyzed. An earlier technique (shear decomposition) is extended to 3D, and it is shown how this can be mapped onto a data-parallel architecture using only grid communication during the resampling associated with the rotation. The rendering uses efficient parallel computation constructs that allow one to use sophisticated shading models and still maintain high-speed throughout. This algorithm has been implemented on the connection machine and is used in an interactive volume-rendering application, with multiple frames-per-second performance.Keywords
This publication has 17 references indexed in Scilit:
- Volume rendering and data feature enhancementACM SIGGRAPH Computer Graphics, 1990
- Particle animation and rendering using data parallel computationACM SIGGRAPH Computer Graphics, 1990
- Efficient ray tracing of volume dataACM Transactions on Graphics, 1990
- Animation of Interactive Fluid Flow Visualization Tools On a Data Parallel MachineThe International Journal of Supercomputing Applications, 1989
- A rendering algorithm for visualizing 3D scalar fieldsACM SIGGRAPH Computer Graphics, 1988
- Volume renderingACM SIGGRAPH Computer Graphics, 1988
- Display of surfaces from volume dataIEEE Computer Graphics and Applications, 1988
- Ray tracing on a connection machinePublished by Association for Computing Machinery (ACM) ,1988
- Marching cubes: A high resolution 3D surface construction algorithmACM SIGGRAPH Computer Graphics, 1987
- 3-D transformations of images in scanline orderPublished by Association for Computing Machinery (ACM) ,1980