Paper studies gradient fields from discrete Morse functions for watershed-cut computation.
problem Computing watershed-cuts from discrete Morse functions.
method Discrete Morse Theory and simplicial stacks.
result Minimum Spanning Forest of dual graph is induced by gradient vector field.