Share Email Print

Proceedings Paper

High-speed image display algorithm for 3-D grid data
Author(s): Akio Doi; Akio Koide
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 1 August 1990
PDF: 13 pages
Proc. SPIE 1259, Extracting Meaning from Complex Data: Processing, Display, Interaction, (1 August 1990); doi: 10.1117/12.19967
Show Author Affiliations
Akio Doi, IBM Japan Ltd. (Japan)
Akio Koide, IBM Japan Ltd. (Japan)

Published in SPIE Proceedings Vol. 1259:
Extracting Meaning from Complex Data: Processing, Display, Interaction
Edward J. Farrell, Editor(s)

© SPIE. Terms of Use
Back to Top