Segmentation tools in mathematical morphology
Handbook of pattern recognition & computer vision
Molecular shape analysis based upon the morse-smale complex and the connolly function
Proceedings of the nineteenth annual symposium on Computational geometry
Morse-smale complexes for piecewise linear 3-manifolds
Proceedings of the nineteenth annual symposium on Computational geometry
AI Magazine
Applications of Forman's Discrete Morse Theory to Topology Visualization and Mesh Compression
IEEE Transactions on Visualization and Computer Graphics
Discrete & Computational Geometry
Topology for Computing (Cambridge Monographs on Applied and Computational Mathematics)
Topology for Computing (Cambridge Monographs on Applied and Computational Mathematics)
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Volumetric Data Analysis using Morse-Smale Complexes
SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
A Topological Approach to Simplification of Three-Dimensional Scalar Functions
IEEE Transactions on Visualization and Computer Graphics
A topological hierarchy for functions on triangulated surfaces
IEEE Transactions on Visualization and Computer Graphics
Smale-like decomposition and forman theory for discrete scalar fields
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Hi-index | 0.00 |
We present an algorithm which produces a decomposition of a regular cellular complex with a discrete Morse function analogous to the Morse-Smale decomposition of a smooth manifold with respect to a smooth Morse function. The advantage of our algorithm compared to similar existing results is that it works, at least theoretically, in any dimension. Practically, there are dimensional restrictions due to the size of cellular complexes of higher dimensions, though. We prove that the algorithm is correct in the sense that it always produces a decomposition into descending and ascending regions of the critical cells in a finite number of steps, and that, after a finite number of subdivisions, all the regions are topological disks. The efficiency of the algorithm is discussed and its performance on several examples is demonstrated.