A short course in computational geometry and topology (Q2449327)

This is a nimble textbook for a short but dense course, one of the few which, besides computational geometry, also deals with computational topology and persistence. In 110 pages the author guides the student through quite a lot of subjects, always with the task of enabling him/her to produce algorithms, but never forgetting to enrich the reader's culture. This is well represented by the very first chapter, where historical roots (from Platonic solids to space filling) are reviewed, but already with a computational attitude. Then we have four parts (three chapters each):{\parindent=6mm \begin{itemize}\item{} Tessellations (Voronoi and Delaunay Diagrams, Weighted Diagrams, Three Dimensions); \item{} Complexes (Alpha Complexes, Holes, Area Formulas); \item{} Homology (Topological Spaces, Homology Groups, Complex Construction); \item{} Persistence (Filtrations, PL Functions, Matrix Reduction). \end{itemize}} All parts end with an exercise list; almost all chapters end with references. The student who doesn't even know what a topological space is, is given the essential knowledge for starting from raw data, building the alpha shape and computing its persistent homology, always knowing what's going on. There is space for the inclusion-exclusion principle, for homotopy equivalence, for the classification of compact surfaces, for Čech and Vietoris-Rips complexes and much more. This is only possible by some smart shortcuts. E.g., chains in homology are defined as sets, and sums as symmetric differences; only later does the author explain that this consists in the particular choice of \({\mathbb Z}_2\) coefficients in a more general homology theory. This strategy might be a bit disorienting for the mathematics student, but is very effective and above all never boring.