26 May 1999 Efficient multidimensional volume rendering
Author Affiliations +
Abstract
In many medical fields, volume rendering is beneficial. For the effective surgery planning, interior objects as well as the surface must be rendered. However, direct volume rendering is computationally expensive and surface rendering cannot represent inside objects of the volume data. In addition, surface rendering has a disadvantage that the huge amount of generated polygons cannot be easily managed even on high-end graphics workstations. This paper presents a way of generating multi-planar imags efficiently. Multi-planar rendering consists of two parts, surface and cutting plane. To efficiently generate surface, our algorithm uses image- based rendering. Image-based rendering generates an image in constant time regardless of the complexity of the input scene. To speed up the performance, our algorithm uses intermediate image space instead of final image space. To reduce the space complexity , we use a new data structure that is based on delta-tree to represent volume. The algorithm was implemented on a Silicon Graphics Indigo 2 workstation with a single 195 MHz R10000 processor and 192MB Main Memory. For the experiments, we use 3 volume data sets, UNC head, engine and brain. Our algorithm takes 5-20 milliseconds to project reference images to the desired view. Including the warping time, 40 milliseconds are required to generate an image.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jae-Jeong Choi, Jae-Jeong Choi, Yeong Gil Shin, Yeong Gil Shin, } "Efficient multidimensional volume rendering", Proc. SPIE 3658, Medical Imaging 1999: Image Display, (26 May 1999); doi: 10.1117/12.349428; https://doi.org/10.1117/12.349428
PROCEEDINGS
8 PAGES


SHARE
Back to Top