Certified computation of planar Morse–Smale complexes. (January 2017)

• Record Type: Journal Article
• Authors: Chattopadhyay, Amit; Vegter, Gert; Yap, Chee K.
• Is Part Of: Journal of symbolic computation. Volume 78(2017)
• Page Start: 3
• Page End: 40
• Publication Date: 2017-01
• Subjects: Morse–Smale complex -- Certified computation -- Interval arithmetic; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2016.03.006
• Languages: English
• ISSNs: 0747-7171

Abstract

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 (Edelsbrunner et al., 2003a ). 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.