Certified computation of planar Morse–Smale complexes

Amit Chattopadhyay, Gert Vegter, Chee K. Yap

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)3-40
Number of pages38
JournalJournal of Symbolic Computation
Volume78
DOIs
StatePublished - Jan 1 2017

Keywords

  • Certified computation
  • Interval arithmetic
  • Morse–Smale complex

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Certified computation of planar Morse–Smale complexes'. Together they form a unique fingerprint.

  • Cite this