A multi-resolution interpolation scheme for pathline based Lagrangian flow representations

  title={A multi-resolution interpolation scheme for pathline based Lagrangian flow representations},
  author={Alexy Agranovsky and Harald Obermaier and Christoph Garth and Kenneth I. Joy},
  booktitle={Electronic Imaging},
Where the computation of particle trajectories in classic vector field representations includes computationally involved numerical integration, a Lagrangian representation in the form of a flow map opens up new alternative ways of trajectory extraction through interpolation. In our paper, we present a novel re-organization of the Lagrangian representation by sub-sampling a pre-computed set of trajectories into multiple levels of resolution, maintaining a bound over the amount of memory mapped… 
Exploratory Lagrangian-Based Particle Tracing Using Deep Learning
A novel deep neural network-based particle tracing method to explore time-varying vector fields represented by Lagrangian flow maps using a trained model to predict new particle trajectories and significantly reducing the burden of I/O when reading data for visualization.
Analysis of Error in Interpolation-Based Pathline Tracing
A formal analysis of the theoretical bound on the error when advecting pathlines using this method is presented and it is found that for interpolation-based pathline tracing the error is closely related to the divergence in the flow field.
Scalable In Situ Computation of Lagrangian Representations via Local Flow Maps
The proposed optimization is a communication-free model resulting in local Lagrangian flow maps, requiring no message passing or synchronization between processes, intrinsically improving scalability, and thereby reducing overall execution time and alleviating the encumbrance placed on simulation codes from communication overheads.
MCFTLE: Monte Carlo Rendering of Finite‐Time Lyapunov Exponent Fields
This work applies a progressive, view‐dependent Monte Carlo‐based approach for the visualization of such Lagrangian fields in time‐dependent flows, which avoids grid discretization and ray marching errors completely, is consistent, and has a low memory consumption.
Accelerated Monte Carlo Rendering of Finite-Time Lyapunov Exponents
The rendering process is accelerated significantly, which allows us to compute video sequence of high-resolution FTLE animations in a much more reasonable time frame and follows two orthogonal approaches to improve on the rendering process: the volumetric light path integration in gradient domain and an acceleration of the transmittance estimation.
A Scalable Streamline Generation Algorithm Via Flux-Based Isocontour Extraction
Experimental results show that the proposed flux-based stream functions for generating streamlines in parallel offers higher streamline computation performance with higher scalability than traditional particle-tracing based method.
Opacity Optimization and Inertial Particles in Flow Visualization
This thesis presents optimization-based approaches that adjust the opacity of lines and surfaces to strive for a balance between the presentation of relevant information and occlusion avoidance and introduces inertial particles as a new application domain to the flow visualization community.
Analysis Enhanced Particle-based Flow Visualization
A number of flow analysis techniques and their extension for PFS data analysis are studied, including the FTLE approach, Jacobian analysis, and an attribute accumlation framework, and it is demonstrated that these analyses can reveal some interesting underlying flow patterns that would be hard to see otherwise via a number of PFS simulated flows.
Backward Finite-Time Lyapunov Exponents in Inertial Flows
It is shown that FTLE on the influence curve vector field is in agreement with preferential particle settling and more importantly it is not only valid for small (near-tracer) particles, which enables backward integration with more general equations of motion in unsteady spatio-velocity phase spaces.
A Fluid Flow Data Set for Machine Learning and its Application to Neural Flow Map Interpolation
This paper constructs a large fluid flow data set and applies it to a deep learning problem in scientific visualization, improving the accuracy of flow map interpolations, allowing a more precise flow analysis at a reduced memory IO footprint.


Interpolation-Based Pathline Tracing in Particle-Based Flow Visualization
A modified k-d tree representation is developed that is capable of creating a dynamic partitioning of even highly compressible data sets with strongly varying particle densities and is able to efficiently perform pathline computation by identifying, tracking, and updating an enclosing, dynamic particle neighborhood as particles move overtime.
Hierarchical Line Integration
An acceleration scheme for the numerical computation of sets of trajectories in vector fields or iterated solutions in maps, possibly with simultaneous evaluation of quantities along the curves such as integrals or extrema, suitable for parallel execution on many-core architectures like GPUs.
Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications
This paper proposes a novel scheme for the adaptive computation of FTLE fields in two and three dimensions that significantly reduces the number of required particle paths and shows on several examples that meaningful results can be obtained by restricting the analysis to a well-chosen plane intersecting the flow domain.
Efficient Visualization of Lagrangian Coherent Structures by Filtered AMR Ridge Extraction
  • F. Sadlo, R. Peikert
  • Computer Science, Physics
    IEEE Transactions on Visualization and Computer Graphics
  • 2007
A method for filtered ridge extraction based on adaptive mesh refinement that 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.
Generation of Accurate Integral Surfaces in Time-Dependent Vector Fields
This work describes an algorithm for surface integration that approximates a series of time lines using iterative refinement and computes a skeleton of the integral surface, which allows a highly accurate treatment of very large time-varying vector fields in an efficient, streaming fashion.
Implicit stream surfaces
Streamlines and stream surfaces are well known techniques for the visualization of fluid flow. For steady velocity fields, a streamline is the trace of a particle, and a stream surface is the trace
Implicit Stream Surfaces
A new method for the construction of stream surfaces based on the representation of a stream surface as an implicit surface f (x) = C so that irregular topologies of the originating curves and of the stream surfaces can be handled easily.
Streak Lines as Tangent Curves of a Derived Vector Field
The first description of streak lines as tangent curves of a derived vector field is developed and it is shown how it can be computed from the spatial and temporal gradients of the flow map, i.e., a dense path line integration is required.
Time and Streak Surfaces for Flow Visualization in Large Time-Varying Data Sets
This work proposes a novel algorithm based on a decoupling of surface advection and surface adaptation that yields improved efficiency over other surface tracking methods, and allows us to leverage inherent parallelization opportunities in the surfaceAdvection, resulting in more rapid parallel computation.