CPSC 091T. Special Topics: Computational Geometry

What is the best way to model a terrain with a 3D mesh? How can a video game instantly detect collisions between objects? How quickly can a robot plan an optimal path? Efficient solutions to geometric problems are essential to navigating physical and virtual worlds. This course will study the design and analysis of algorithms and data structures for those problems. We will discuss examples from geographic information systems (GIS), computer graphics, and robotics, but our primary approach will be theoretical, with an emphasis on time complexity and proofs of correctness.
This is a Group 1 course.
Prerequisite: CPSC 035 and MATH 027 or above.
Natural science.
1.0 credit
Fall 2023. Lutz.
Catalog chapter: Computer Science
Department website: https://www.swarthmore.edu/computer-science

Access the class schedule to search for sections.