| |
Oct 17, 2026
|
|
|
|
|
2026-2027 University Catalog
|
CS 53100 - Computational Geometry
Credit Hours: 3.00. Computational geometry studies how to compute with and reason about geometric objects. The subject is playing an increasingly important role in computer graphics, game software, geometric modeling, geographic information systems, and many other applications. Course topics include convex hull, segment manipulations, triangulations, range searching, Voronoi diagrams, window queries, Delaunay triangulation, and duality. Some key algorithms are implemented. Questions of floating-point accuracy and robust algorithm design are considered throughout the course.
Learning Outcomes
1. Be familiar with topics in geometric structures and algorithms such as the ones listed above. 2. Be familiar with how to design algorithms for geometric problems with techniques listed above. 3. Master a subset of algorithms: Convex hull, Delaunay triangulations, Curve/Surface reconstructions, Topological Data analysis. 4. Learn how these algorithms can be applied in areas like computer graphics, geometric modeling, reverse engineering, and topological data analysis. 5. Be familiar with how to research the background of a topic in geometric algorithms.
Credit Hours: 3.00
|
|