Certified computation of planar Morse–Smale complexes

Amit Chattopadhyay, Gert Vegter, Chee K. Yap

OnderzoeksoutputAcademicpeer review

4 Citaten (Scopus)
43 Downloads (Pure)

Samenvatting

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.

Originele taal-2English
Pagina's (van-tot)3-40
Aantal pagina's38
TijdschriftJournal of symbolic computation
Volume78
DOI's
StatusPublished - 1-jan.-2017

Vingerafdruk

Duik in de onderzoeksthema's van 'Certified computation of planar Morse–Smale complexes'. Samen vormen ze een unieke vingerafdruk.

Citeer dit