# Computational Geometry

## CSCI-4560

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.

4 credits Communication Intensive
Cross-listed with:
CSCI-6560 Computational Geometry
Prereqs:
CSCI-2300 Introduction To Algorithms
and
CSCI-2600 Principles Of Software

# Past Term Data
Offered
Not Offered
Offered as Cross-Listing Only
No Term Data
Simple View
Detailed View

| Spring | Summer | Fall
--- | --- | --- | ---
| (Session 1) | (Session 2) |
2024 |  |  |
2023 |  |  | Computational Geometry (4c) [CI] Barbara Cutler Seats Taken: 13/40
2022 |  |  |
2021 |  |  |
2020 |  |  |
2019 |  |  |
2018 |  |  |
2017 |  |  |
2016 |  |  |
2015 |  |  |
2014 |  |  |
2013 |  |  |
2012 |  |  |
2011 |  |  |
2010 |  |  |
2009 |  |  |
2008 |  |  |
2007 |  |  |
2006 |  |  |
2005 |  |  |
2004 |  |  |
2003 |  |  |
2002 |  |  |
2001 |  |  |
2000 |  |  |
1999 |  |  |
1998 |  |  |