Share Email Print
cover

Proceedings Paper

Optimizing particle tracing in unsteady vector fields
Author(s): Al Globus
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

Unsteady 3-D computational fluid dynamics (CFD) results can be very large. Some recent solutions exceed 100 gigabytes. Visualization techniques that access the entire data set will, therefore, be excruciatingly slow. We show that particle tracing in vector fields calculated from disk resident solutions can be accomplished in O(number-of-particles) time, i.e., visualization time is independent of solution size. This is accomplished using memory mapped files to avoid unnecessary disk IO, and lazy evaluation of calculated vector fields to avoid unnecessary CPU operations. A C++ class hierarchy implements lazy evaluation such that visualization algorithms are unaware that the vector field is not stored in memory. A numerical experiment conducted on two solutions differing in size by a factor of 100 showed that particle tracing times varied by only 10-30 percent. Other visualization techniques that do not access the entire solution should also benefit from memory mapping and lazy evaluation.

Paper Details

Date Published: 4 April 1994
PDF: 7 pages
Proc. SPIE 2178, Visual Data Exploration and Analysis, (4 April 1994); doi: 10.1117/12.172063
Show Author Affiliations
Al Globus, Computer Sciences Corp. at Nasa Ames Research Ctr. (United States)


Published in SPIE Proceedings Vol. 2178:
Visual Data Exploration and Analysis
Robert J. Moorhead; Deborah E. Silver; Samuel P. Uselton, Editor(s)

© SPIE. Terms of Use
Back to Top