COMP 572 - Computational Geometry |
Spring 2008 |
| Instructor-- | Danny Krizanc |
| Office-- | 631 Science Center |
| Office Hours-- | By appointment |
| Phone-- | 860-685-2186 |
| E-mail-- | dkrizanc at wesleyan dot edu |
This course will cover the design and analysis of efficient algorithms for geometric problems. Basic topics will include algorithms for triangulating polygons, computing convex hulls and Voronoi diagrams. Depending on the time available other more advanced topics will be addressed such as probabilistic and heuristic algorithms.
There is no required text. Here are two texts that I would recommend as references:
A nice set of lecture notes is available here.
Recent work on computational geometry can be found in the proceedings of the Annual Symposium on Computational Geometry which can be reached through the library website - search for the ACM Digital Library, follow links for Proceedings and look for SCG.
For those without a background in algorithms, the basic material on Big Oh notation, solving recurrences and basic data structures can be found in any of these books:
| Report problems to dkrizanc at wesleyan.edu
|