Announcements

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.

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: