 |
|
||||||||||||||||||
 |
 |
 |
 |
 |
 |
 |
 |
|
|||||||||||
|
|
||||||||||||||||||
|
|
||||||||||||||||||
|
|
||||||||||||||||||
CSE555
| Course | CSE555 |
| Title | Computational Geometry |
| Description | We study 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. |
| Prerequisite | CSE 373 or CSE 548 |
| Credit Information | 3 - credits |
| Course Webpage |
