One-Dimensional Computational Topology

CS 598 JGE, Fall 2020

Jeff Erickson (
TuTh 11:00–12:15 (via Zoom)
Office Hours
Fri 9-10 (class only)
Wed Fri 3-4 (open/public)


Dec 21
Project presentation videos are now available. And that's it for the semester!
Dec 8
Final project presentations have been scheduled the following days and times: Check this web page and/or your email for your group's assigned date and time. There will be four 20-minute presentations in each time slot. The schedule page is password protected; use the same credentials as the Paper Chase submissions and project submissions.
Nov 29
Because of the pandemic, all course evaluations are now being solicited thorugh ICES Online. Evaluations forms for this class are available through Thursday, December 10. Please fill out an evaluation form; your feedback is extremely important, especially narrative feedback. (Please submit evaluations for all your other courses as well!)
Nov 23
Final project logistics:
Nov 5
Video of yesterday's presentation of all project proposals is available on a restricted MediaSpace channel, which is accessible only to registered students (via Shibboleth). Videos of final project presentations will eventually be posted to the same channel.
Nov 4
Everyone's project proposals are available, again only to registered students. Use the same credentials as the Paper Chase submissions.
Oct 23
Everyone's submissions for the Paper Chase assignment are available, but only to registered students. Check your email for the password. (Hint: Seven spaces.)
Oct 5
Project proposals are due Friday, October 30. This is a hard deadline! Each student submits their own individual 2-to-3-page proposal.
Sep 1
The first writing assignment is due September 21.
Aug 31
Aug 17
Hello and welcome! I'm still setting up the class; please forgive the dust, construction noises, and dead links. First some logistics:

About this class

This course will be an introduction to my favorite facet of computational topology: Algorithms for curves and graphs embedded in the plane or other surfaces. Algorithmic questions about curves have been a driving force in topology since its inception more than a century ago. Planar and near-planar graphs have long been fertile ground for algorithms research, both because they naturally model many classes of networks that arise in practice, and because they admit simpler and faster algorithms than more general graphs. There is a rich interplay between these two domains, drawing on a common pool of techniques from geometry, topology, and combinatorics. Potential topics include topological graph theory; homotopy, homology, and other topological invariants; specialized algorithms for shortest paths, maximum flows, and minimum cuts; efficient approximation schemes for NP-hard problems; and applications in VLSI design, computer graphics, computer vision, motion planning, geographic information systems, and other areas of computing. Specific topics will depend on the interest and expertise of the students.

Students in all areas of computer science, mathematics, and related disciplines are welcome. CS 473 and/or Math 525 are recommended as prerequisites, but not required; necessary background material will be introduced as needed. Undergraduates interested in taking this course can get a registration override at the first lecture.

Other computational topology classes

The selection of topics in this class is necessarily limited by the finiteness of a single semester and by my own interests and expertise. Important topics in computational topology that I will not cover this semester, except perhaps briefly in passing, include automatic groups, knot theory, 3-manifolds, cell complexes (simplicial, cubical, Delta, CW, simplicial sets), discrete Morse theory, normal surface theory, configuration spaces, dynamical systems, persistent homology and its generalizations, surface reconstruction, manifold learning, topological data analysis, embedding obstructions, higher-order homotopy, discrete differential geometry, fixed-point theorems, applied Hodge theory, algebraic complexity, evasiveness of graph properties, impossibility results in distributed computing, and topological quantum computing. The full diversity of techniques, results, applications, and even definitions of computational topology could easily fill a dozen courses.

Here is an incomplete (and rather outdated) list of other recent courses in computational topology with publicly available course materials (beyond just a syllabus). Please let me know if you'd like to add your course!


Creative Commons License   Powered by MathJax