Combining concepts from topology and algorithms, this book delivers what its title 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.
Computational Topology, An Introduction continues the well established tradition of mathematics textbooks that do not bother to explain their relevance or utility. Although there is an anemic little chapter at the end entitled “Applications� containing hints of how computational topology might be used to solve a few (four) actual problems of fairly narrow interest, it is insufficient. Persistence homology theory is difficult and exotic and likely to stay that way, at least until a better introduction appears. People need to understand why they should invest the hundreds of hours it would take to master this material—what advantage does it bring?
My advice to any potential reader is to check the book out from a library, read the last chapter and then see if you’re motivated to buy the book.