Course Profile:

Me:           Robert Pless                        pless@cse.wustl.edu
office hours: Tuesday, 4:30-5:30, Thursday 2-3

TA:           Martin Hassett                      mmh2@cec.wustl.edu
office hours: Thursday 7-8

Course Framework:

5 homeworks       (25%)
midterm           (30%) 
final and project (45%)

Topics:

Week 2: Convex Hulls
Week 3: Intersections
Week 4: Polygon Triangulation
Week 5: Linear Programming
Week 6: Range Searching                           Midterm: Feb 25
Week 7: Point Location
Week 8: Voronoi Diagrams
Week 9: Arrangements/Duality
Week 0: Delaunay Triangulations
Week 1: Motion planning
Week 2: Geometric Approximation Algorithms        Final: April 24


Academic Integrity: 

All work in this class should be done independently.  You are allowed
to discuss class material, homework problems, and general solution
strategies with your classmates.  But when you get to formulating,
writing or actually programming solutions, you must work alone.  If
you use any outside sources (papers or books in the literature, other
students or friends, web sites, etc), you must cite them.

You will learn the most if you solve problems on your own from start
to finish, but I will not penalize you for making use of outside help
if you cite your sources clearly.  Representing other's work as your
own, however, is plagiarism.  These cases will be forwarded to the
SEAS discipline committee.