Share Email Print
cover

Proceedings Paper

Parallel processing for view-dependent polygonal virtual environments
Author(s): Jihad El-Sana; Amitabh Varshney
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

This paper presents a parallel algorithm for preprocessing as well as real-time navigation of view-dependent virtual environments on shared memory multiprocessors. The algorithm proceeds by hierarchical spatial subdivision of the input dataset by an octree. The parallel algorithm is robust and does not generate any artifacts such as degenerate triangles and mesh foldovers. The algorithm performance scales linearly with increase in the number of processors as well as increase in the input dataset complexity. The resulting visualization performance is fast enough to enable interleaved acquisition and modification with interactive visualization.

Paper Details

Date Published: 25 March 1999
PDF: 9 pages
Proc. SPIE 3643, Visual Data Exploration and Analysis VI, (25 March 1999); doi: 10.1117/12.342848
Show Author Affiliations
Jihad El-Sana, SUNY/Stony Brook (United States)
Amitabh Varshney, SUNY/Stony Brook (United States)


Published in SPIE Proceedings Vol. 3643:
Visual Data Exploration and Analysis VI
Robert F. Erbacher; Philip C. Chen; Craig M. Wittenbrink, Editor(s)

© SPIE. Terms of Use
Back to Top