Computational Topology
An Introduction
Seiten
2010
American Mathematical Society (Verlag)
978-0-8218-4925-5 (ISBN)
American Mathematical Society (Verlag)
978-0-8218-4925-5 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. It covers motivating problems in both mathematics and computer science. Building up from classic topics in geometric and algebraic topology, it covers persistent homology.
Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering. The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department.
Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering. The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department.
Herbert Edelsbrunner, Duke University, Durham, NC and Geomagic, Research Triangle Park, NC, USA John L. Harer, Duke University, Durham, NC, USA
Preface
Part I. Computational geometric topology
Graphs
Surfaces
Complexes
Part II. Computational algebraic topology
Homology
Duality
Morse functions
Part III. Computational persistent topology
Persistence
Stability
Applications
References
Index
| Erscheint lt. Verlag | 30.1.2010 |
|---|---|
| Reihe/Serie | Monograph Books |
| Verlagsort | Providence |
| Sprache | englisch |
| Gewicht | 605 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Geometrie / Topologie |
| ISBN-10 | 0-8218-4925-5 / 0821849255 |
| ISBN-13 | 978-0-8218-4925-5 / 9780821849255 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Gekrümmte Kurven und Flächen
Buch | Softcover (2024)
De Gruyter (Verlag)
CHF 76,90
a history of modern trigonometry
Buch | Softcover (2025)
Princeton University Press (Verlag)
CHF 34,90
