AMS 545/ CSE 555 Course Material, Spring 2018

Joe Mitchell, Math Tower P-139A, 632-8366

The course meets Tues/Thurs 10:00am-11:20am in Melville Library W4525.

Tentative Office Hours for Joe (Spring 2018): Mon (2:00-3:30), Wed (2:30-4:00), or by appointment, or drop by whenever (don't be shy!)
(during the first week of class, Joe's hours will be Mon (Jan 22) 2:30-4:00 and Wed (Jan 24) 11:00-12:00 )


YOU SHOULD DEFINITELY COME TO THE FIRST CLASS MEETING (Tues, Jan 23, 2018) if you think you are enrolled or you hope to be enrolled and MAY be interested in taking the course! I will be giving a detailed overview of the course and what to expect, etc.

The course has been hovering around "full", at room capacity. Unfortunately, SOLAR does not allow a wait list for cross-listed courses; thus, if you are interested in adding the class, please send Joe an email, as we are manually keeping a wait list. We are also actively requesting a larger room. In all the years I have taught the course, I have never ended up having to turn away any students that wanted to take the course.

Our TA this semester is TBA.

Main Course Information

Course Information (AMS 545/CSE 555, Spring 2018) This is the main course information sheet (syllabus) with details about exams, homeworks, grading, etc. All homeworks, handouts will be posted on Blackboard.

Homeworks and Other Handouts

See Blackboard.
Some SAMPLE PROJECTS, done by previous students: randomized incremental CH (java); point location search in trapezoidal diagram (Visual C++).

Miscellaneous Links of Relevance:

  • Required textbook, "Computational Geometry: Algorithms and Applications", by de Berg, Cheong, van Kreveld, and Overmars (3rd Edition).
  • Recommended textbook, "Computational Geometry in C, 2nd Edition" by O'Rourke (2nd Edition),
  • Recommended textbook, "Discrete and Computational Geometry". by Devadoss and O'Rourke
  • David Mount's course notes on CG
  • CG Tutorial, with applets
  • Geometry software, part of
  • Godfried Toussaint's CG page where Godfried keeps many useful links to cool stuff in CG
  • G. Aloupis. A history of linear-time convex hull algorithms for simple polygons.
  • Graph drawing slides, Dynamic CG slides, Brown University
  • A description of Melkman's algorithm (the applet link no longer works)
  • Link to T. Chan's paper on output sensitive convex hull computation (in 2D and 3D). See also the convex hull algorithms notes of Robert Pless
  • Computational Geometry Course Notes by Rashid Bin Muhammad at Kent State
  • The Open Problems Project (TOPP), Erik Demaine, Joe Mitchell, and Joe O'Rourke
  • NYU Geometry Seminars
  • David Eppstein's Geometry in Action
  • Jeff Erickson's Geometry Page
  • David Eppstein's General Geometric References
  •, page of Chris Gold
  • CGAL, the Computational Geometry Algorithms Library