COSC 49.12 Topics in Computational Topology

Planar graphs are among the most well-studied graph classes since the beginning of graph theory and algorithm design. Planar graphs can manifest in computational problems as networks, meshes, or terrains that are geometric and low-dimension in nature, which unsurprisingly find many applications in computer graphics, visualization, vehicle routing, and shape analysis. This graduate-level seminar-style course is aimed to introduce a vast array of tools for planar graphs, ranging from combinatorial to geometric to spectral to algorithmic and beyond. Naturally, due to the sheer amount of work and literature in the area, the topics covered in this class will be biased towards the interest and expertise of the instructor.

Instructor

Chang

Prerequisite

COSC 30 or Math 38 and Math 22, Math 24 or COSC 70 or Instructor Permission. Knowledge in algorithms (COSC 31) is strongly recommended.

Degree Requirement Attributes

Dist:QDS

The Timetable of Class Meetings contains the most up-to-date information about a course. It includes not only the meeting time and instructor, but also its official distributive and/or world culture designation. This information supersedes any information you may see elsewhere, to include what may appear in this ORC/Catalog or on a department/program website. Note that course attributes may change term to term therefore those in effect are those (only) during the term in which you enroll in the course.