Issue No. 10 - October (2011 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2010.235
Jan Reininghaus , Zuse Institute Berlin, Berlin
Christian Löwen , Zuse Institute Berlin, Berlin
Ingrid Hotz , Zuse Institute Berlin, Berlin
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.
Flow visualization, graph algorithms.
J. Reininghaus, C. Löwen and I. Hotz, "Fast Combinatorial Vector Field Topology," in IEEE Transactions on Visualization & Computer Graphics, vol. 17, no. , pp. 1433-1443, 2010.