CSE555
| Course | CSE555 |
|---|---|
| Title | Computational Geometry |
| Credits | 3 - credits |
| Course Coordinator | |
| Description |
Study of the fundamental algorithmic problems associated with geometric computations, including convex hulls, Voronoi diagrams, triangulation, intersection, range queries, visibility, arrangements, and motion planning for robotics. Algorithmic methods include plane sweep, incremental insertion, randomization, divide-and-conquer, etc. This course is offered as both AMS 545 and CSE 555.
|
| Course Outcomes | |
| Textbook | |
| Major Topics Covered in Course | |
| Laboratory | |
| Course Webpage |
|