Paper
4 April 1994 Optimizing particle tracing in unsteady vector fields
Al Globus
Author Affiliations +
Proceedings Volume 2178, Visual Data Exploration and Analysis; (1994) https://doi.org/10.1117/12.172063
Event: IS&T/SPIE 1994 International Symposium on Electronic Imaging: Science and Technology, 1994, San Jose, CA, United States
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); https://doi.org/10.1117/12.172063
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Particles

Visualization

C++

Optimization (mathematics)

Computational fluid dynamics

Physics

Aerodynamics

RELATED CONTENT


Back to Top