Visualization of intricate flow structures for vortex breakdown analysis

Journal ArticleVortex breakdowns and flow recirculation are essential phenomena in aeronautics where they appear as a limiting factor in the design of modern aircrafts. Because of the inherent intricacy of these features, standard flow visualization techniques typically yield cluttered depictions. The paper addresses the challenges raised by the visual exploration and validation of two CFD simulations involving vortex breakdown. To permit accurate and insightful visualization we propose a new approach that unfolds the geometry of the breakdown region by letting a plane travel through the structure along a curve. We track the continuous evolution of the associated projected vector field using the theoretical framework of parametric topology. To improve the understanding of the spatial relationship between the resulting curves and lines we use direct volume rendering and multi-dimensional transfer functions for the display of flow-derived scalar quantities. This enriches the visualization and provides an intuitive context for the extracted topological information. Our results offer clear, synthetic depictions that permit new insight into the structural properties of vortex breakdowns

Constructing streak surfaces for 3D unsteady vector fields

Visualization of 3D, unsteady flow (4D) is very difficult due to both perceptual challenges and the large size of 4D vector field data. One approach to this challenge is to use integral surfaces to visualize the 4D properties of the field. However the construction of streak surfaces has remained elusive due to problems stemming from expensive computation and complex meshing schemes. We present a novel streak surface construction algorithm that generates the surface using a quadrangular mesh. In contrast to previous approaches the algorithm offers a combination of speed for exploration of 3D unsteady flow, high precision, and places less restriction on data or mesh size due to its CPU-based implementation compared to a GPU-based method. The algorithm can be applied to large data sets because it is based on local operations performed on the quad primitives. We demonstrate the technique on a variety of 3D, unsteady simulation data sets to show its speed and robustness. We also present both a detailed implementation and a performance evaluation. We show that a technique based on quad meshes handles large data sets and can achieve interactive frame rates

Easy Integral Surfaces: A Fast, Quad-based Stream and Path Surface Algorithm

a fast, quad-based stream and path surface algorith