Offered: Fall 2025 (current)
This course explores the design, analysis, and implementation of algorithms for solving geometric computational problems, with applications in robotics, computer graphics, GIS, and machine learning. Topics include convex hulls, Voronoi diagrams, geometric data structures, motion planning, and robustness challenges. Students will learn to apply computational geometry principles to real-world scenarios.
The core objectives of this course are:
Design algorithms for convex hulls, Voronoi diagrams, and polygon decomposition.
Implement data structures for efficient queries.
Analyze robustness challenges in geometric computations.
Apply computational geometry to real-world problems in graphics, robotics, and GIS.
1. To Be Added
| # | Description | Weight | Edit |
|---|
