Computational Topology

MATH 619

Introduction to topology via graphs; facts about curves and surfaces; representing triangulations; discussion of simplicial complexes; emphasis on Delaunay and alpha complexes and on homology groups; computational via matrix reduction; Morse functions; PL functions; Reeb graphs; development of persistent homology; proof of stability; applications and extensions. Prerequisite: Computer Science 532. Instructor: Staff
Curriculum Codes
  • QS
Cross-Listed As
  • COMPSCI 636