Discrete Morse Functions and Watersheds

01/10/2023
by   Gilles Bertrand, et al.
0

Any watershed, when defined on a stack on a normal pseudomanifold of dimension d, is a pure (d – 1)-subcomplex that satisfies a drop-of-water principle. In this paper, we introduce Morse stacks, a class of functions that are equivalent to discrete Morse functions. We show that the watershed of a Morse stack on a normal pseudomanifold is uniquely defined, and can be obtained with a linear-time algorithm relying on a sequence of collapses. Last, but not the least, we prove that such a watershed is the cut of the unique minimum spanning forest, rooted in the minima of the Morse stack, of the facet graph of the pseudomanifold.

READ FULL TEXT

page 5

page 7

page 14

research
03/22/2022

Gradient Vector Fields of Discrete Morse Functions are Minimum Spanning Forests

In this paper, we prove that discrete Morse functions are equivalent to ...
research
08/30/2019

A Simple Algorithm for Minimum Cuts in Near-Linear Time

We consider the minimum cut problem in undirected, weighted graphs. We g...
research
11/02/2021

Finding the KT partition of a weighted graph in near-linear time

In a breakthrough work, Kawarabayashi and Thorup (J. ACM'19) gave a near...
research
06/01/2023

Linear codes with arbitrary dimensional hull and pure LCD code

In this paper, we introduce a general construction of linear codes with ...
research
11/01/2020

A polynomial algorithm for minimizing discrete convic functions in fixed dimension

Recently classes of conic and discrete conic functions were introduced. ...
research
02/06/2020

Data-based computation of stabilizing minimum dwell times for discrete-time switched linear systems

We present an algorithm to compute stabilizing minimum dwell times for d...

Please sign up or login with your details

Forgot password? Click here to reset