A short course in computational geometry and topology
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to algebraic topology (55-01) Software, source code, etc. for problems pertaining to algebraic topology (55-04) Simplicial sets and complexes in algebraic topology (55U10) Shapes (aspects of topological manifolds) (57N25) Combinatorics in computer science (68R05)
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.
- Voronoi game on polygons
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
- Robustness and percolation of holes in complex networks
- Spatial distribution of invasive species: an extent of occurrence approach
- Persistence barcodes and Laplace eigenfunctions on surfaces
- Inferring topology of quantum phase space
- Modelling persistence diagrams with planar point processes, and revealing topology with bagplots
- Quantitative aspects of acyclicity
- Parameter estimation in systems exhibiting spatially complex solutions via persistent homology and machine learning
- Geometric metrics for topological representations
- Computational topology. An introduction
- scientific article; zbMATH DE number 41544 (Why is no real title available?)
- Upwind Schemes for Scalar Advection-Dominated Problems in the Discrete Exterior Calculus
- Geometric and topological inference
- Persistence modules, symplectic Banach-Mazur distance and Riemannian metrics
- Methods of equivariant topology in two Nice discrete geometry problems
- The -Delaunay tessellation: Description of the model and geometry of typical cells
- Modeling of persistent homology
- scientific article; zbMATH DE number 7206834 (Why is no real title available?)
- Statistical topology and the random interstellar medium
- Persistent homology detects curvature
- Computational Topology
- scientific article; zbMATH DE number 5048526 (Why is no real title available?)
- Geometric goodness of fit measure to detect patterns in data point clouds
- Tilt: topological interface recovery in limited-angle tomography
- Homological percolation on a torus: plaquettes and permutohedra
- A persistent-homology-based Bayesian prior for potential coefficient reconstruction in an elliptic partial differential equation
- Betti numbers in the random connection model for higher-dimensional simplicial complexes and the Boolean model
- Networks beyond pairwise interactions: structure and dynamics
This page was built for publication: A short course in computational geometry and topology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449327)
