# CS 598: Computational Topology (Fall 2009)

### Announcements

A path in a planar region and a lift to the universal cover.

From Gao et al. [SOCG 1998]

### About this class

Computational topology is an emerging field of study at the intersection of mathematics and computer science, devoted to the study of efficient algorithms for topological problems, especially those that arise in other areas of computing. Although algorithmic techniques have been ubiquitous in topology since its inception more than a century ago, the efficiency of topological algorithms and their applicability to other computing domains are relatively recent areas of study. Results in computational topology combine classical mathematical techniques from combinatorial, geometric, and algebraic topology with more recent algorithmic tools from data structure design and computational geometry. These results have found applications in many different areas of computer science.

This course will be a broad introduction to computational topology; the precise topics covered will depend on the skills and interests of the course participants. Potential mathematical topics include the topology of cell complexes, topological graph theory, homotopy, covering spaces, simplicial homology, persistent homology, discrete Morse theory, discrete differential geometry, and normal surface theory. Potential computing topics include algorithms for computing topological invariants, graphics and geometry processing, mesh generation, curve and surface reconstruction, VLSI routing, motion planning, manifold learning, clustering, image processing, and combinatorial optimization.

Students in all areas of computer science, mathematics, and related disciplines are welcome. CS 573 and/or Math 525 are recommended as prerequisites, but not required; necessary background material will be introduced as needed.

### Other computational topology classes

The selection of topics in this class is necessarily limited by the finiteness of a single semester, and biased by my own interests and expertise. The full diversity of techniques, results, applications, and even *definitions* of computational topology could easily fill a dozen courses. Here is a sample of some other classes/seminars in computational topology and some closely related fields:
- Otfried Cheong and Sunghee Choi, KAIST
- Mathieu Desbrun, Caltech
- Herbert Edelsbrunner, Duke University
- Joachim Giesen and Michael Sagraloff, Max-Planck-Institut für Informatik
- Rob Ghrist, University of Pennsylvania
- Anil Hirani, UIUC
- Jeffrey Ho, University of Florida
- Susan Holmes, MSRI
- Dmitriy Morozov, Stanford University
- Abubakr Muhammad, McGill University
- Valerio Pascucci, University of Utah — No course web page(?!)
- Afra Zomorodian, Dartmouth College
- Sarah Day, William and Mary — No course web page
- Chee Yap, NYU