Out-of-Core Streamline Visualization on Large Unstructured Meshes

This paper presents an out-of-core approach for interactive streamline construction on large unstructured tetrahedral meshes containing millions of elements. The out-of-core algorithm uses an octree to partition and restructure the raw data into subsets stored into disk files for fast data retrieval. A memory management policy tailored to the streamline calculations is used such that, during the streamline construction, only a very small amount of data are brought into the main memory on demand. By carefully scheduling computation and data fetching, the overhead of reading data from the disk is significantly reduced and good memory performance results. This out-of-core algorithm makes possible interactive streamline visualization of large unstructured-grid data sets on a single mid-range workstation with relatively low main-memory capacity: 5-15 megabytes. We also demonstrate that this approach is much more efficient than relying on virtual memory and operating system's paging algorithms.

[1]  C. T. Cox,et al.  Elementary fluid mechanics , 1954 .

[2]  Rajeev Thakur,et al.  Compiler and runtime support for out-of-core HPF programs , 1994, ICS '94.

[3]  Kwan-Liu Ma,et al.  Fast Algorithms for Visualizing Fluid Motion in Steady Flow on Unstructured Grids , 1995, Proceedings Visualization '95.

[4]  Jeff P. Hultquist,et al.  Constructing stream surfaces in steady 3D vector fields , 1992, Proceedings Visualization '92.

[5]  Rainald Löhner,et al.  A vectorized particle tracer for unstructured grids , 1990 .

[6]  Abraham Silberschatz,et al.  Operating System Concepts , 1983 .

[7]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[8]  Robert Haimes,et al.  pV3 - A distributed system for large-scale unsteady CFD visualization , 1994 .

[9]  David A. Lane,et al.  Interactive Time-Dependent Particle Tracing Using Tetrahedral Decomposition , 1996, IEEE Trans. Vis. Comput. Graph..

[10]  David N. Kenwright,et al.  A 3-D streamline tracking algorithm using dual stream functions , 1992, Proceedings Visualization '92.

[11]  Arnold L. Rosenberg,et al.  Time- and space-optimality in B-trees , 1981, TODS.

[12]  Clifford A. Shaffer,et al.  A Paging Scheme for Pointer-Based Quadtrees , 1993, SSD.

[13]  Robert Haimes,et al.  Visualization of 3-D vector fields - Variations on a stream , 1992 .

[14]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[15]  Robert Haimes,et al.  APPLICATION OF THE pV3 CO-PROCESSING VISUALIZATION ENVIRONMENT TO 3-D UNSTRUCTURED MESH CALCULATIONS , 1995 .

[16]  Kwan-Liu Ma,et al.  Efficient Streamline, Streamribbon, and Streamtube Constructions on Unstructured Grids , 1996, IEEE Trans. Vis. Comput. Graph..

[17]  Peter B. Galvin,et al.  Operating System Concepts, 4th Ed. , 1993 .

[18]  Joseph W. H. Liu,et al.  On the storage requirement in the out-of-core multifrontal method for sparse factorization , 1986, TOMS.

[19]  A. George,et al.  Auxiliary Storage Methods for Solving Finite Element Systems , 1985 .

[20]  N. Brenner.  Fast Fourier transform of externally stored data , 1969 .

[21]  J. Miller.  Numerical Analysis , 1966, Nature.