A Quantized Boundary Representation of 2D Flows
Computer Graphics Forum
Parallel Computation of 3D Morse-Smale Complexes
Computer Graphics Forum
Nearly Recurrent Components in 3D Piecewise Constant Vector Fields
Computer Graphics Forum
Energy-scale aware feature extraction for flow visualization
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
Stable morse decompositions for piecewise constant vector fields on surfaces
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
Design and evaluation of multifield visualisation techniques for 2D vector fields
Proceedings of the 27th Conference on Image and Vision Computing New Zealand
Visualizing robustness of critical points for 2D time-varying vector fields
EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization
| Hi-index | 0.00 |
This paper introduces a novel approximation algorithm for the fundamental graph problem of combinatorial vector field topology (CVT). CVT is a combinatorial approach based on a sound theoretical basis given by Forman's work on a discrete Morse theory for dynamical systems. A computational framework for this mathematical model of vector field topology has been developed recently. The applicability of this framework is however severely limited by the quadratic complexity of its main computational kernel. In this work, we present an approximation algorithm for CVT with a significantly lower complexity. This new algorithm reduces the runtime by several orders of magnitude and maintains the main advantages of CVT over the continuous approach. Due to the simplicity of our algorithm it can be easily parallelized to improve the runtime further.