2009
DOI: 10.1016/j.comgeo.2008.11.001
|View full text |Cite
|
Sign up to set email alerts
|

Ascending and descending regions of a discrete Morse function

Abstract: 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 sens… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(9 citation statements)
references
References 23 publications
0
9
0
Order By: Relevance
“…Within this applicative context, the segmentation of simplicial complexes was the subject of many papers in the last decade. L. De Floriani et al [28,16] tackled the problem as a Smale-like decomposition in discrete Morse theory (see also [29]) where the simplicial complex is segmented into ascending and descending subcomplexes. Based on the same theory, H. Edelsbrunner and J. Harer [27] proposed another decomposition algorithm and they informally discuss some links with watershed algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…Within this applicative context, the segmentation of simplicial complexes was the subject of many papers in the last decade. L. De Floriani et al [28,16] tackled the problem as a Smale-like decomposition in discrete Morse theory (see also [29]) where the simplicial complex is segmented into ascending and descending subcomplexes. Based on the same theory, H. Edelsbrunner and J. Harer [27] proposed another decomposition algorithm and they informally discuss some links with watershed algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…The discrete analogues of these objects were constructed by Jerše and Mramor Kosta in [4]. The idea is that descending discs should be unions of V -paths, just as in the smooth case (where descending discs are foliated by integral curves of a gradient-like vector field).…”
Section: Theorem 27 ([3]mentioning
confidence: 99%
“…The connections between discrete Morse theory (or simple homotopy), persistent homology, and the use of stable and unstable manifolds to partition scalar functions on cell complexes have also been explored recently by other authors [18,19,20,21,22,7].…”
Section: Introductionmentioning
confidence: 99%