COMPSCI 236 - Computational Topology

Institution:

Duke University

Subject:

Computer Science

Description:

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 230. Instructor: Edelsbrunner or Harer

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

WWW.DUKE.EDU

Phone Number:

(919) 684-8111

Regional Accreditation:

Southern Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.