George Mason University
DEPARTMENT OF COMPUTER SCIENCE
CS699 - Advanced Topics / Computational Geometry - Spring 2003
Tuesday 4:30-7:10, Sci and Tech II 430A
Prerequisites |
Description |
Readings |
Syllabus |
Grading |
Late |
Dates
TA and Instructions for Mailing List
This page last updated on 11/11/02.
Professor Dana Richards
703-993-1545
richards@cs.gmu.edu
Course office hours: Tuesday and Thursday 11:00-12:00 or by appt.
Sci&Tech II Room 425
PREREQUISITES :
CS583 or equivalent background in algorithms.
DESCRIPTION :
Many applications have software that deals with geometric objects.
This course is centered on the core algorithmic and data structure
issues that arise in such applications. The discussion will be almost
entirely focused on algorithmic issues. Problems considered include:
conves hulls, intersecting line segments, polygon triangulation,
orthogonal range searching, planar point location, voronoi diagrams,
delauney triangulation, and visibility.
READINGS:
- de Berg, van Kreveld, Overmars Scwarzkopf, Computational Geometry, Springer 1997.
SYLLABUS:
The pace can not be predicted.
We should cover most of chapters 1-3, 5-7, 9-10.
GRADING :
Homework -- 70%
Presentation -- 30%
Each week a few homework problems will be assigned.
These will be collected and graded.
There will be an in-class presentation at the end of the semester.
The topic, chosen by agreement between the student and professor, can
be a more in-depth treatment of a prior topic, or come from areas not
yet covered in lecture.
There is to be NO group work on graded work.
LATENESS:
Homework will be marked down 25% each week they are late.