Issue No. 12 - Dec. (2012 vol. 18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2012.198
Wieland Reich , University of Leipzig
Gerik Scheuermann , University of Leipzig
Existing methods for analyzing separation of streamlines are often restricted to a finite time or a local area. In our paper we introduce a new method that complements them by allowing an infinite-time-evaluation of steady planar vector fields. Our algorithm unifies combinatorial and probabilistic methods and introduces the concept of separation in time-discrete Markov-Chains. We compute particle distributions instead of the streamlines of single particles. We encode the flow into a map and then into a transition matrix for each time direction. Finally, we compare the results of our grid-independent algorithm to the popular Finite-Time-Lyapunov-Exponents and discuss the discrepancies.
Vectors, Eigenvalues and eigenfunctions, Markov processes, Transmission line matrix methods, Sparse matrices, Approximation methods, Topology, uncertainty, Vector field topology, flow visualization, feature extraction
W. Reich and G. Scheuermann, "Analysis of Streamline Separation at Infinity Using Time-Discrete Markov Chains," in IEEE Transactions on Visualization & Computer Graphics, vol. 18, no. , pp. 2140-2148, 2012.