CS 498 TC, Fall 2024:
Computational Geometry
Instructor
Timothy Chan
(tmc "at" illinois.edu, office hours: Tuesdays 23pm (or by appointment), Siebel 3230)
Meeting Time/Place
Tue & Thu 3:304:45pm, Lu MEB 3101
Course Work
 5 Homeworks
 Midterm (October 7 Monday 7pm9pm)
 Final Exam
 For grad students taking the 4credit version, there is also
a presentation of a research paper.
Administrivia
Course Overview
We will study efficient algorithms for a variety of fundamental geometric problems: convex hulls, Voronoi diagrams/Delaunay triangulations, lowdimensional linear programming, line segment intersection, polygon triangulation, geometric
shortest paths, visibility, etc.
Computational geometry has applications to many areas (geometric data are everywhere), although the focus of the course is on theoretical results and techniques (we will encounter lots of cool algorithmic ideas, including divideandconquer, pruneandsearch, randomization, plane sweep, etc.). A solid background in algorithm design and analysis is assumed (at the level of CS374).
References
There is no required textbook, but you may find the following useful (all accessible online for UIUC students):

[BCKO] M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars,
Computational
Geometry: Algorithms and Applications (3rd ed.),
SpringerVerlag, 2008

[PS] F. P. Preparata and M. I. Shamos,
Computational Geometry: An Introduction,
SpringerVerlag, 1985

[GRT] J. Goodman, J. O'Rourke, and C. D. Toth (eds.),
Handbook of Discrete and Computational Geometry (3rd ed.),
CRC Press, 2017
Lectures
(Scribbles from class, and links to relevant book chapters or papers, will be provided below.
For registered students, lecture recordings may be accessed
on mediaspace.)