Computer Science – Computational Geometry
Scientific paper
2010-01-08
Discrete Comput Geom (2012) 47:347-377
Computer Science
Computational Geometry
27 pages, 8 figures
Scientific paper
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance {\delta} 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{\delta}, 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.
Bauer Ulrich
Lange Carsten
Wardetzky Max
No associations
LandOfFree
Optimal topological simplification of discrete functions on surfaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Optimal topological simplification of discrete functions on surfaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal topological simplification of discrete functions on surfaces will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-502480