Parallel processing for view-dependent polygonal virtual environments

Jihad El-Sana, Amitabh Varshney

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations

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.

Original languageEnglish
Pages (from-to)62-70
Number of pages9
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume3643
StatePublished - 1 Jan 1999
Externally publishedYes
EventProceedings of the 1999 Visual Data Exploration and Analysis VI - San Jose, CA, USA
Duration: 27 Jan 199928 Jan 1999

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Parallel processing for view-dependent polygonal virtual environments'. Together they form a unique fingerprint.

Cite this