Paper
28 May 2001 Multiprocessor iso-surface volume rendering
Mark J.S. van Doesburg, Jaap Smit
Author Affiliations +
Abstract
The rendering of iso-surfaces in a scalar 3D dataset can be performed with a new algorithm, called iso surface volume rendering. This algorithm does not introduce sampling artifacts or artifacts due to triangularization. The risk to skip very small details by insufficient re-sampling is also eliminated. Another advantage is its speed compared to conventional volume rendering. So far we achieved speeds in the order of ten frames per second on advanced CPU's. The multiprocessor implementation of this new algorithm uses a division of the voxel data into multiple cubes. These cubes are the basis for distributing the workload onto several processors. A scheduler process is running to perform the distribution of the workload. During the distribution of the workload the scheduler also eliminates the need to render invisible parts of the dataset. This reduces the part of the dataset which must be processed to one third of the original dataset for typical applications. Another major advantage of the scheduling algorithm is that the communication overhead is reduced by a factor of ten to twenty, which allows for the efficient use of many processors.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mark J.S. van Doesburg and Jaap Smit "Multiprocessor iso-surface volume rendering", Proc. SPIE 4319, Medical Imaging 2001: Visualization, Display, and Image-Guided Procedures, (28 May 2001); https://doi.org/10.1117/12.428110
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computing systems

Volume rendering

Binary data

Algorithm development

Interfaces

Computer architecture

Data processing

Back to Top