AMS 545/ CSE 555 Course Material, Spring 2009

Joe Mitchell, Math Tower 1-109, 632-8366

The course meets Mon/Wed, 2:20--3:40pm in Earth and Space 079.

All ARE Welcome!


Announcements:

5/11/09: I brought hard copies to the review session today of the following handout:
http://www.ams.sunysb.edu/~jsbm/courses/345/additional-problems-for-final.pdf
Recall that your final exam will be comprised of problems taken from:
1. hw5, hw6, hw7, hw8
2. the two practice finals (on the course website, with solutions)
3. the review sheet (on course website)
4. the list of additional problems (url above), which we went over in the review today. (No solutions are written up, but if you have specific questions after you attempt to solve them, feel free to ask. We did most of them on the board.)
The exam is closed book, closed notes.
Bring colored pencils/pens if you want for the drawings. A straightedge could be useful too.
The final will be 2:00-3:15pm on Wed, May 13, in Library E4320 (note the room!). Come early to get set up.
At 3:15-4:30, you may optionally take the Second Chance Midterm.

The final exam will be in Library E4320, 2:00, Wed, May 13. The first half (75 minutes) will be a noncummulative exam on hw 5-8 material; the second half of the period (3:15-4:30) will be for a second-chance retake of the midterm (see the course info sheet).
There will be a Review Session on Monday, May 11, 12:00-1:30 in Math P-131.

Our TA for the course is Shuai Shao (shsshao@gmail.com); office hours Mon 9:30-10:30am, Tues 3:30-4:30pm in Harriman 010.
My office hours are, tentatively, Mon (12:00-1:00), Tue (12:30-2:00), or email me for an alternate times, or whenever you drop by and I am free (don't be shy!)
The introductory class on Monday, January 26 ( Powerpoint slides are available) will give an overview of what computational geometry is and what types of problems we study in the course. I will include some demos, which are applets linked from the slides and linked below.

Main Course Information

Course Information (AMS 545), / CSE 555Spring 2009 This is the main course information sheet with details about exams, homeworks, grading, etc.

Lecture Topics, giving brief notes of what is covered each class

Picasa album of board shots
Lots of information about what computational geometry is all about can be found at Jeff Erickson's Geometry Page.

Homeworks and Other Handouts


The introductory class on Monday, January 26 ( Powerpoint slides are available) will give an overview of what computational geometry is and what types of problems we study in the course. I will include some demos, which are applets linked from the slides and linked below. Homework 1, due Wednesday, Feb 11 in class ( Large versions of the figures for HW1)
Solution notes for HW1 (posted after due date)

Homework 2, due Wednesday, Feb 18 in class
Solution notes for HW2

Handout on monotone polygons and triangulating monotone mountains

Homework 3, due Wednesday, March 4 (revised) in class
( Large versions of the figures for HW3)
Solution notes for HW3

Notes on Melkman's Algorithm

Homework 4, due Wednesday, Mar 11 in class.
Solution notes for HW4

Practice Midterm (AMS 345 version)
Solutions

Review Outline for Midterm (AMS 345)

Homework 5, due Wednesday, April 1 (update: by 12:00, Friday, April 3)
Solution notes for HW5

Notes on Voronoi and Delaunay

Homework 6, due Wednesday, April 15 (revised: due by 12:00, Friday, April 17)
Large instance of point set for problem (4)
Solution notes for HW6 (updated)

Homework 7, due Monday, April 27
Solution notes for HW7

Examples on duality
An example related to problem 1, HW7

Homework 8, due Wednesday, May 6
Solution notes for HW8


Notes on Bentley-Ottmann sweep example

Notes on Kirkpatrick point location algorithm

Practice Final (AMS 345)
Solutions

Review Outline for Final

Miscellaneous Links of Relevance:

  • Required textbook, by de Berg, Cheong, van Kreveld, and Overmars (3rd Edition).
  • Recommended textbook by O'Rourke, entitled "Computational Geometry in C, 2nd Edition"
  • Computational Geometry at Stony Brook
  • Tom Fevens course notes, slides and links, following our text
  • Geometry software, part of geometryalgorithms.com
  • Godfried Toussaint's CG page where Godfried keeps many useful links to cool stuff in CG
  • Graph drawing slides, Dynamic CG slides, Brown University
  • Convex hull algorithm applets, with cool Java applets for Graham's scan, Jarvis' march, and Quick hull
  • A description of Melkman's algorithm (the applet link no longer works)
  • link to T. Chan's paper on output sensitive convex hull computation. See also the convex hull algorithms notes of Robert Pless (based on
  • David Mount's course notes on CG
  • On the Hertel-Mehlhorn algorithm to compute a decomposition of a simple polygon into convex polygons
  • shortest path in simple polygon, with horizontal trapezoidization, triangulation, "random" simple (monotone) polygon; by Josh Tyler
  • Search the geom.bib, Barcelona search engine
  • The Open Problems Project (TOPP), with J. O'Rourke and E. Demaine
  • NYU Geometry Seminars
  • Computational Geometry on the WWW, Maintained by Guilherme Albuquerque Pinto
  • David Eppstein's Geometry in Action
  • Jeff Erickson's Geometry Page
  • David Eppstein's General Geometric References
  • Mesh Generation Pages
  • Voronoi.com, page of Chris Gold
  • CGAL, the Computational Geometry Algorithms Library
  • Directory of Computational Geometry Software
  • QuickCD, Stony Brook's fast collision detection code (my work with J. Klosowski, M. Held)