The State of the Art in Flow Visualization: Dense and Texture-Based Techniques

Flow visualization has been a very attractive component of scientific visualization research for a long time. Usually very large multivariate datasets require processing. These datasets often consist of a large number of sample locations and several time steps. The steadily increasing performance of computers has recently become a driving factor for a reemergence in flow visualization research, especially in texture-based techniques. In this paper, dense, texture-based flow visualization techniques are discussed. This class of techniques attempts to provide a complete, dense representation of the flow field with high spatio-temporal coherency. An attempt of categorizing closely related solutions is incorporated and presented. Fundamentals are shortly addressed as well as advantages and disadvantages of the methods. Categories and Subject Descriptors (according to ACM CCS): I.3 [Computer Graphics]: visualization, flow visualization, computational flow visualizatio

[Research activities in applied mathematics, fluid mechanics, and computer science]

This report summarizes research conducted at the Institute for Computer Applications in Science and Engineering in applied mathematics, fluid mechanics, and computer science during the period April 1, 1995 through September 30, 1995

Extraction and Visualization of Swirl and Tumble Motion from Engine Simulation Data

Figure 1: Unsteady visualization of vortices from in-cylinder tumble motion in a gas engine and its relationship to the boundary. During the valve cycle (left to right), the piston head that shapes the bottom of the geometry moves down (not shown). The volume rendering shows vortices using a two-dimensional transfer function of λ2 and normalized helicity (legend). The main tumble vortex is extracted and visible as off-center and with an undesired diagonal orientation. The flow structure on the boundary is visualized using boundary topology. A direct correspondence between the volume and boundary visualizations can be observed. In the third image, the intersection of the main vortex with the boundary results in critical points on the front and back walls. Optimizing the combustion process within an engine block is central to the performance of many motorized vehicles. Associated with this process are two important patterns of flow: swirl and tumble motion, which optimize the mixing of fluid within each of an engine’s cylinders. Good visualizations are necessary to analyze the simulation data of these in-cylinder flows. We present a range of methods including integral, feature-based, and imagebased schemes with the goal of extracting and visualizing these tw

[Activity of Institute for Computer Applications in Science and Engineering]

This report summarizes research conducted at the Institute for Computer Applications in Science and Engineering in applied mathematics, fluid mechanics, and computer science

Out-of-Core Streamline Visualization on Large Unstructured Meshes

It's advantageous for computational scientists to have the capability to perform interactive visualization on their desktop workstations. For data on large unstructured meshes, this capability is not generally available. In particular, particle tracing on unstructured grids can result in a high percentage of non-contiguous memory accesses and therefore may perform very poorly with virtual memory paging schemes. The alternative of visualizing a lower resolution of the data degrades the original high-resolution calculations. 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-20 megabytes. Our test results also show that this approach is much more efficient than relying on virtual memory and operating system's paging algorithms