Computational Geometry

CIS 788, Winter, 2003

Table of Contents

Course Summary

Discrete and computational geometry, convex hull algorithms, linear programming, triangulations, Voronoi diagrams, Delaunay triangulations, line arrangements, line segment intersection, binary space partitions, quadtrees. 

Course Information

Time: MWF 10:30 am
Place:  266 Dreese Lab
Instructor: Dr. R. Wenger
Office hours: See my office hours.
Text: Computational Geometry by de Berg, van Kreveld, Overmars, Schwarzkopf Pohang, Second Edition, Springer-Verlag, ISBN 3-540-65620-0 (required.)

Related Web Pages


Grading

Homework 30%, Midterm 30%, Final 40%.

Students are expected to attend class regularly. In the event that a student must miss a class, the student is responsible for finding out what assignments were made, what due dates were announced, and what material was covered. Late homework will NOT receive credit. 

Topics :

Handouts

Homeworks


Announcements

Last Updated by R. Wenger :  6 Jan 2003