Optimal topological simplification of discrete functions on surfaces

We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved by establishing a connection between discrete Morse theory and persistent homology. Our method completely removes homological noise with persistence less than 2, constructively proving the tightness of a lower bound on the number of critical points given by the stability theorem of persistent homology in dimension two for any input function. We also show that an optimal solution can be computed in linear time after persistence pairs have been computed.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Ulrich Bauer, Carsten Lange, Max Wardetzky
• Keywords: CORR 2010, Critical Points, Education, Input Function, Persistent Homology