3 papers
cs.CV2026
Playing with Kruskal: algorithms for flat and hierarchical watershed cuts
Jean Cousty, Laurent Najman, Benjamin Perret +1
In the framework of edge-weighted graphs, watersheds have proven to be linked to well-known optimization problems, as Minimum Spanning Tree, which allowed the design of efficient a…
cs.DM2025
Computing gradient vector fields with Morse sequences
Gilles Bertrand, Laurent Najman
We rely on the framework of Morse sequences to enable the direct computation of gradient vector fields on simplicial complexes. A Morse sequence is a filtration from a subcomplex $…
cs.DM2024
Morse frames
Gilles Bertrand, Laurent Najman
In the context of discrete Morse theory, we introduce Morse frames, which are maps that associate a set of critical simplexes to all simplexes. The main example of Morse frames are…