AMS 545, Computational Geometry
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.
3 credits, ABCF grading

Text: Computational Geometry: Algorithms and Applications, by deBerg, Cheong, van Kreveld, and Overmars, Springer-Verlag

Offered in the Fall 2008 Semester. Starting in spring 2009, it will be offered in the spring semester.


Spring 2009 Section
Joe Mitchell, MW 2:20- 3:40 pm, Earth and Space 079, AMS545 Webpage

Spring 2010 Section
54668 LEC 01 MW 02:20-03:40PM Loc: TBA Inst: Joseph Mitchell AMS545 Webpage