4 April 1994 Optimizing particle tracing in unsteady vector fields
Author Affiliations +
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.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Al Globus, "Optimizing particle tracing in unsteady vector fields", Proc. SPIE 2178, Visual Data Exploration and Analysis, (4 April 1994); doi: 10.1117/12.172063; https://doi.org/10.1117/12.172063
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT

Real-time simulation of snow in flight simulator
Proceedings of SPIE (February 08 2005)
Exploratory simulation for astrophysics
Proceedings of SPIE (January 29 2007)
Octree optimization
Proceedings of SPIE (June 01 1991)
Interaction of objects in a virtual environment a two...
Proceedings of SPIE (August 01 1991)

Back to Top