Syllabus - CS 266 - Computational Geometry
Michael T. Goodrich
- Course description.
Algorithms and data structures for geometric computation and graphics
programming. Fundamental problems of computational geometry such as
convex hulls, Voronoi diagrams, Delaunay triangulations, polygon
partitioning, arrangements, geometric searching, hidden surface
elimination, motion planning.
- Coursework. Coursework will consist of homeworks,
a midterm, and a final exam. The overall grade
will be determined 30% from homework, 40% from the two midterms, and
30% from the final.
Group work on homeworks is permitted, but each
student must list his or her collaborators in writing for each problem.
If a student turns in a solution without listing
the others who helped produce this solution,
this act will be considered cheating (for it is plagarism).
Late homework assignments will not be accepted.
- Exam policy.
Exam performance must be 100% individual effort; no collaboration
is allowed on exams. Any collaboration or copying on exams
will be considered cheating.
In addition to the procedures of the
Cheating Policy, students caught cheating on exams will be given a
failing grade in the class.
- Laptop policy.
Laptops may be brought to class, but should remain closed during lectures
- Textbook. de Berg, Cheong, van Kreveld, and Overmars,
Computational Geometry: Algorithms and Applications, Springer,
2008, 3rd edition.
- Week 1:
- Reading: Chapter 1.
- Week 2:
Line segment intersections. Doubly-connected edge list. Boolean
- Reading: Chapter 2.
- Reading: Chapter 3.
- Reading: Chapter 4.
- Reading: Chapter 5.
- Reading: Chapter 6.
- Reading: Chapter 7.
Arrangements and Duality.
- Reading: Chapter 8.
Geometric data structures.
- Reading: Chapters 9 and 10.
3-D Convex Hulls.
- Reading: Chapter 11.
Copyright © 2015
Michael T. Goodrich, as to all lectures.
Students are prohibited from selling
(or being paid for taking) notes during this course to or by any
person or commercial firm without the express written permission of the
professor teaching this course.