• 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 40% from homework, 30% from the midterm, 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 ICS Cheating Policy, students caught cheating on exams will be given a failing grade in the class.
• Text. de Berg, Cheong, van Kreveld, and Overmars, Computational Geometry: Algorithms and Applications, Springer, 2008, 3rd edition.
• Add/drop policy. Drops will be accepted only up to the end of the third week.

Tentative Schedule

• Week 1:
• Introduction. Convex hulls.
• Reading: Chapter 1.
• Week 2:
• Line segment intersections. Doubly-connected edge list. Boolean operations.
• Reading: Chapter 2.
• Week 3:
• Polygon triangulation.
• Reading: Chapter 3.
• Week 4:
• Linear programming.
• Reading: Chapter 4.
• Week 5:
• Range searching.
• Reading: Chapter 5.
• Week 6:
• Point location.
• Reading: Chapter 6.
• Week 7:
• Voronoi diagrams, Arrangements, and Delaunay triangulations.
• Reading: Selected sections of chapters 7, 8, and 9.
• Week 8:
• Geometric data structures. Interval trees, priority search trees, segment trees.
• Reading: Chapter 10.
• Week 9:
• 3-dimensional convex hulls and binary space partitions.
• Reading: Chapters 11 and 12.
• Week 10:
  • Motion planning.
  • Reading: Chapter 13.

Copyright © 2011 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.