COMPSCI 266
Computational Geometry
The design and analysis of algorithms and data structures for computational geometry, with applications to machine learning, computer vision, and graphics. Topics: convex hulls, Voronoi diagrams, Delaunay triangulations, geometric arrangements, polygon triangulation, and data structures for geometric searching and modeling.
Topics
- convex hulls
- Voronoi diagrams
- Delaunay triangulations
- geometric arrangements
- polygon triangulation
- and data structures for geometric searching and modeling
Topics explicitly listed in official catalogue description
Prerequisites & course information
The design and analysis of algorithms and data structures for computational geometry, with applications to machine learning, computer vision, and graphics. Topics: convex hulls, Voronoi diagrams, Delaunay triangulations, geometric arrangements, polygon triangulation, and data structures for geometric searching and modeling.
Sources
- Course catalogue ↗2026-2027