Parallel processing for view-dependent polygonal virtual environments

Jihad El-Sana; Amitabh Varshney

doi:10.1117/12.342848

25 March 1999 Parallel processing for view-dependent polygonal virtual environments

Jihad El-Sana, Amitabh Varshney

Proceedings Volume 3643, Visual Data Exploration and Analysis VI; (1999) https://doi.org/10.1117/12.342848
Event: Electronic Imaging '99, 1999, San Jose, CA, United States

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.

Citation Download Citation

Jihad El-Sana and Amitabh Varshney "Parallel processing for view-dependent polygonal virtual environments", Proc. SPIE 3643, Visual Data Exploration and Analysis VI, (25 March 1999); https://doi.org/10.1117/12.342848

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available