15-859 Special Topics in Theory: Computational Geometry

6–12 units, Carnegie Mellon University

This course aims to provide an introduction to computational geometry and numerical computation to those with some background in algorithms and geometry. Focus will be in low, especially 2, dimensions. Main topics are plane sweeps, convexity, geometric construction/optimization, optimization algorithms in low to intermediate dimensions, and geometric data structures. Evaluations will consist of 5 homework and a final exam, and will be flexible to allow both theoretical and implementation perspectives.

Prerequisites: none listed

Offered: Fall 2026

Courseweave needs JavaScript to show sections, workloads and planning tools.