Produktdetaljer
'A must-have up-to-date computational account of a vibrant area connecting pure mathematics with applications.' Herbert Edelsbrunner, IST Austria
'This book provides a comprehensive treatment of the algorithmic aspects of topological persistence theory, both in the classical one-parameter setting and in the emerging multi-parameter setting. It is an excellent resource for practitioners within or outside the field, who want to learn about the current state-of-the-art algorithms in topological data analysis.' Steve Oudot, Inria and Ecole polytechnique
'There are many things to appreciate about this book, including the abundance of excellent and helpful figures, the extensive reference list, and the variety of instructive exercises for students to work through … Thanks to its inclusion of so much cutting-edge recent work and state-of-the-art algorithms, this is an ideal book for mathematicians or computer scientists looking to dive into this exciting and still very young area of research.' Ellen Gasparovic, Mathematical Association of America Reviews
'This is a much needed update and contribution to the vast and rapidly growing area of computational topology. It will be the new go-to text for years to come.' Nicholas A. Scoville
'As a complete package, the book is an ideal text for a first course on topological data analysis for beginning graduate students … Highly recommended.' M. Clay, Choice
'The work under consideration provides a thorough and comprehensive introduction to computational topology. The book is largely self-contained and does not presuppose prior knowledge of topology.' Walter D. Freyn, MathSciNet