1 August 1990 High-speed image display algorithm for 3-D grid data
Author Affiliations +
In this paper, we propose a high-speed and direct imaging algorithm for constructing equi-valued surfaces from 3D grid data in scientific and enneering fields. Our basic idea is to generate and draw polygons simultaneously by processing the cells spanned by grids in order of decreasing distance from the current viewpoint. Equi-valued surfaces are generated in five tetrahedrons into which the cells are subdivided, and are sent to a graphics device. The execution order of each of the tetrahedrons is identical and determined by the current viewpoint. Since the algorithm does not need a store of intermediate polyhedral data, depth calculation, or depth buffer memory for hidden surface removal, the user can get a quick response to changes of the view direction and of the surface constant C in interactive graphics. This algorithm is particularly powerful for imaging multiple surfaces associated with multiple surface constants in semi-transparent display.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Akio Doi, Akio Doi, Akio Koide, Akio Koide, } "High-speed image display algorithm for 3-D grid data", Proc. SPIE 1259, Extracting Meaning from Complex Data: Processing, Display, Interaction, (1 August 1990); doi: 10.1117/12.19967; https://doi.org/10.1117/12.19967


Medical Image Processing On An Enhanced Workstation
Proceedings of SPIE (June 27 1988)
Three-dimensional (3D) stereoscopic X windows
Proceedings of SPIE (March 30 1995)
3D display using intersection of light beams
Proceedings of SPIE (May 03 2000)
True Three Dimensional (3 D) Display Of Computer Data ...
Proceedings of SPIE (January 14 1982)
Real-time 3D display with acousto-optical deflectors
Proceedings of SPIE (May 24 1999)

Back to Top