Optimizing particle tracing in unsteady vector fields

Details Optimizing particle tracing in unsteady vector fields Optimizing particle tracing in unsteady vector fields

Apr 1994

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1994spie.2178..127g&link_type=abstract

Proc. SPIE Vol. 2178, p. 127-133, Visual Data Exploration and Analysis, Robert J. Moorhead; Deborah E. Silver; Samuel P. Uselton

Statistics

Computation

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Optimizing particle tracing in unsteady vector fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimizing particle tracing in unsteady vector fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing particle tracing in unsteady vector fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1263008