We will study theoretical and practical solutions to computational geometry problems found in computer graphics, visualization, vision, robotics, engineering, manufacturing, and geographic information systems. Â Topics include convex hulls, half-planes, Voronoi diagrams, Delaunay triangulations, binary space partitions, motion planning, visibility, and meshes. Course activities include programming assignments, written homework with proofs of computational complexity, and a term project with presentation. Â Â Â Â
| Spring | Summer | Fall | ||
|---|---|---|---|---|
| (Session 1) | (Session 2) | |||
| 2023 | ||||
| 2022 | ||||
| 2021 | ||||
| 2020 | ||||
| 2019 | ||||
| 2018 | ||||
| 2017 | ||||
| 2016 | ||||
| 2015 | ||||
| 2014 | ||||
| 2013 | ||||
| 2012 | ||||
| 2011 | ||||
| 2010 | ||||
| 2009 | ||||
| 2008 | ||||
| 2007 | ||||