Critical sets in discrete Morse theories: Relating Forman and piecewise-linear approaches

Morse theory inspired several robust and well-grounded tools in discrete function analysis, geometric modeling and visualization. Such techniques need to adapt the original differential concepts of Morse theory in a discrete setting, generally using either piecewise-linear (PL) approximations or Formanʼs combinatorial formulation. The former carries the intuition behind Morse critical sets, while the latter avoids numerical integrations. Formanʼs gradients can be constructed from a scalar function using greedy strategies, although the relation with its PL gradient is not straightforward. This work relates the critical sets of both approaches. It proves that the greedy construction on two-dimensional meshes actually builds an adjacent critical cell for each PL critical vertex. Moreover, the constructed gradient is globally aligned with the PL gradient. Those results allow adapting the many works in PL Morse theory for triangulated surfaces to Formanʼs combinatorial setting with low algorithmic complexity.

► The definitions of Morse critical sets from Banchoff (PL) and Forman are related.
► It is proven that greedy construction yields non-decreasing Forman gradient fields.
► On simplicial surfaces, such construction is proven to contain Banchoff critical set.
► This results in fast and robust algorithms for Smale decomposition and persistence.
► A fast construction of Reeb graphs from Smale decomposition is shown as application.