pith. sign in

arxiv: 1506.06265 · v1 · pith:KOOMFB5Lnew · submitted 2015-06-20 · 💻 cs.CG

Certified Computation of planar Morse-Smale Complexes

classification 💻 cs.CG
keywords morse-smalecomplexescertifiedcomplexcomputeplanaralgorithmcase
0
0 comments X
read the original abstract

The Morse-Smale complex is an important tool for global topological analysis in various problems of computational geometry and topology. Algorithms for Morse-Smale complexes have been presented in case of piecewise linear manifolds. However, previous research in this field is incomplete in the case of smooth functions. In the current paper we address the following question: Given an arbitrarily complex Morse-Smale system on a planar domain, is it possible to compute its certified (topologically correct) Morse-Smale complex? Towards this, we develop an algorithm using interval arithmetic to compute certified critical points and separatrices forming the Morse-Smale complexes of smooth functions on bounded planar domain. Our algorithm can also compute geometrically close Morse-Smale complexes.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.