Search

An escape map is the partial mapping from seed points to exit points of streamlines in a bounded domain. The escape map is piecewise continuous, and a topological segmentation of the domain boundary yields the regions and curve segments on which it is continuous. Escape maps have recently been introduced in the context of studying the connectivity of coronal holes. Computation of escape maps faces the problem of exponentially diverging streamlines, where standard adaptive streamsurface methods can fail. As a tool to detect such places and to guide escape map computation, a technique based on isoclines has recently been proposed (Machado et al., IEEE Trans. Vis. Comput. Graph. 20(12):2604–2613, 2014). We show in this paper that, in the case of a divergence-free vector field, boundary switch connectors can be used as a purely topological alternative, which to the best of our knowledge is the first practical application of boundary switch connectors. We provide a systematic approach to the topological segmentation of 3D domain boundaries for divergence-free vector fields. Finally, we explore an alternative approach based on streamtubes and targeted at robustness in escape map computation. Simulation results as well as a synthetic vector field are used for validation.

We present a dense visualization of vector fields on multi-layered surfaces. The method is based on the illustration buffer, which provides a screen space representation of the surface, where each pixel stores a list of all surface layers. This representation is implemented on the GPU using shaders and leads to a fast output sensitive technique. In our approach, we first use procedural noise to create an initial spot pattern on the surface that has both an almost constant screen space frequency and is view independent. Then, we perform anisotropic diffusion simultaneously on all surface layers using a discretization scheme that maintains second order convergence while only accessing the four neighboring pixels. Finally, we enhance this result with illustrative techniques and composite the final image. Our method works with time-evolving surfaces, time-dependent vector fields, and moving cameras. We apply our method to CFD data sets from engineering and astronomy as well as synthetic velocity fields. © 2012 Wiley Periodicals, Inc.

Given an unsteady flow field, one common way to compute Lagrangian Coherent Structures (LCS) is to extract extremal structures of the Finite Time Lyapunov Exponent (FTLE). Experience has shown that the resulting structures are often close to material structures (i.e., material lines or material surfaces). Moreover, it has been proven that for an integration time converging to infinity, they converge to exact material structures. However, due to the finite integration time in FTLE, they are generally not exact material structures. In this paper we introduce a modification of the FTLE method which is guaranteed to produce separating material structures as features of a scalar field. We achieve this by incorporating the complete available integration time both in forward and backward direction, and by choosing an appropriate definition for separating structures. We apply our method to two test data sets and show the differences to classical FTLE.

In the visualization of flow simulation data, feature detectors often tend to result in overly rich response, making some sort of filtering or simplification necessary to convey meaningful images. In this paper we present an approach that builds upon a decomposition of the flow field according to dynamical importance of different scales of motion energy. Focusing on the high-energy scales leads to a reduction of the flow field while retaining the underlying physical process. The presented method acknowledges the intrinsic structures of the flow according to its energy and therefore allows to focus on the energetically most interesting aspects of the flow. Our analysis shows that this approach can be used for methods based on both local feature extraction and particle integration and we provide a discussion of the error caused by the approximation. Finally, we illustrate the use of the proposed approach for both a local and a global feature detector and in the context of numerical flow simulations. acceptedVersion

Vector fields are a common concept for the representation of many different kinds of flow phenomena in science and engineering. Methods based on vector field topology are known for their convenience for visualizing and analyzing steady flows, but a counterpart for unsteady flows is still missing. However, a lot of good and relevant work aiming at such a solution is available. We give an overview of previous research leading towards topologybased and topology-inspired visualization of unsteady flow, pointing out the different approaches and methodologies involved as well as their relation to each other, taking classical (i.e., steady) vector field topology as our starting point. Particularly, we focus on Lagrangian methods, space-time domain approaches, local methods, and stochastic and multi-field approaches. Furthermore, we illustrate our review with practical examples for the different approaches. acceptedVersion

Flow visualization is a fascinating sub-branch of scientific visualization. With ever increasing computing power, it is possible to process ever more complex fluid simulations. However, a gap between data set sizes and our ability to visualize them remains. This is especially true for the field of flow visualization which deals with large, timedependent, multivariate simulation datasets. In this paper, geometry based flow visualization techniques form the focus of discussion. Geometric flow visualization methods place discrete objects in the vector field whose characteristics reflect the underlying properties of the flow. A great amount of progress has been made in this field over the last two decades. However, a number of challenges remain, including placement, speed of computation, and perception. In this survey, we review and classify geometric flow visualization literature according to the most important challenges when considering such a visualization, a central theme being the seeding object upon which they are based. This paper details our investigation into these techniques with discussions on their applicability and their relative merits and drawbacks. The result is an up-to-date overview of the current state-of-the-art that highlights both solved and unsolved problems in this rapidly evolving branch of research. It also serves as a concise introduction to the field of flow visualization research.

In this paper we present an extended critical point concept which allows us to apply vector field topology in the case of unsteady flow. We propose a measure for unsteadiness which describes the rate of change of the velocities in a fluid element over time. This measure allows us to select particles for which topological properties remain intact inside a finite spatio-temporal neighborhood. One benefit of this approach is that the classification of critical points based on the eigenvalues of the Jacobian remains meaningful. In the steady case the proposed criterion reduces to the classical definition of critical points. As a first step we show that finding an optimal Galilean frame of reference can be obtained implicitly by analyzing the acceleration field. In a second step we show that this can be extended by switching to the Lagrangian frame of reference. This way the criterion can detect critical points moving along intricate trajectories. We analyze the behavior of the proposed criterion based on two analytical vector fields for which a correct solution is defined by their inherent symmetries and present results for numerical vector fields.

Feature-based flow visualization is naturally dependent on feature extraction. To extract flow features, often higher order properties of the flow data are used such as the Jacobian or curvature properties, implicitly describing the flow features in terms of their inherent flow characteristics (for example, collinear flow and vorticity vectors). In this paper, we present recent research that leads to the (not really surprising) conclusion that feature extraction algorithms need to be extended to a time-dependent analysis framework (in terms of time derivatives) when dealing with unsteady flow data. Accordingly, we present two extensions of the parallel-vectors-based vortex extraction criteria to the time-dependent domain and show the improvements of feature-based flow visualization in comparison to the steady versions of this extraction algorithm both in the context of a high-resolution data set, that is, a simulation specifically designed to evaluate our new approach and for a real-world data set from a concrete application.

This paper presents a method for filtered ridge extraction based on adaptive mesh refinement. It is applicable in situations where the underlying scalar field can be refined during ridge extraction. This requirement is met by the concept of Lagrangian coherent structures which is based on trajectories started at arbitrary sampling grids that are independent of the underlying vector field. The Lagrangian coherent structures are extracted as ridges in finite Lyapunov exponent fields computed from these grids of trajectories. The method is applied to several variants of finite Lyapunov exponents, one of which is newly introduced. High computation time due to the high number of required trajectories is a main drawback when computing Lyapunov exponents of 3-dimensional vector fields. The presented method allows a substantial speed-up by avoiding the seeding of trajectories in regions where no ridges are present or do not satisfy the prescribed filter criteria such as a minimum finite Lyapunov exponent.

In today's CFD-assisted turbomachinery design, a primary objective is to minimize the effects of vortices. Their automatic identification, along with other flow structures, in numerical data is a current research topic. This paper presents a novel method to find vortex hulls in turbomachinery flows automatically. Based on a vortex core line that is the centerline of the vortex, the method is able to locate bent vortices and to distinguish adjacent vortices in the complex flows. We experiment with the method on several practical flow data sets from the field of turbomachinery.