Introduction to Topological Data Analysis
Abstract
This document introduces the key concepts and algorithms of Topological Data Analysis in low dimensions.
First, the input data representation is formalized.
Second, some of the core concepts of Topological Data Analysis are presented, including critical points, notions of Persistent Homology, Reeb graphs and Morse-Smale Complexes.
Finally, a brief review of the state-of-the-art algorithms is presented.
For the reader's convenience, the most important definitions and properties are highlighted with boxes.
For further readings, I refer the reader to the excellent introduction to Computational Topology by Edelsbrunner and Harer.
Loading...