This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hierarchy of Stable Morse Decompositions
May 2013 (vol. 19 no. 5)
pp. 799-810
A. Szymczak, Dept. of Electr. Eng. & Comput. Sci., Colorado Sch. of Mines, Golden, CO, USA
We introduce an algorithm for construction of the Morse hierarchy, i.e., a hierarchy of Morse decompositions of a piecewise constant vector field on a surface driven by stability of the Morse sets with respect to perturbation of the vector field. Our approach builds upon earlier work on stable Morse decompositions, which can be used to obtain Morse sets of user-prescribed stability. More stable Morse decompositions are coarser, i.e., they consist of larger Morse sets. In this work, we develop an algorithm for tracking the growth of Morse sets and topological events (mergers) that they undergo as their stability is gradually increased. The resulting Morse hierarchy can be explored interactively. We provide examples demonstrating that it can provide a useful coarse overview of the vector field topology.
Index Terms:
Vectors,Trajectory,Numerical stability,Stability criteria,Topology,Indexes,vector field,Morse decomposition,persistence
Citation:
A. Szymczak, "Hierarchy of Stable Morse Decompositions," IEEE Transactions on Visualization and Computer Graphics, vol. 19, no. 5, pp. 799-810, May 2013, doi:10.1109/TVCG.2012.147
Usage of this product signifies your acceptance of the Terms of Use.