AMS 545/ CSE 555 Course Material, Fall 2007

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

The course meets Tuesday/Thursday, 3:50 -- 5:10, in Earth and Space Science 069.

All are Welcome!

This course is intended for anyone who has interest in designing and analyzing efficient algorithms for problems on geometric data (points, lines, segments, circles, polygons, CAD models, etc). This includes researchers in computer graphics, visualization, CAD/CAM, geographic information systems, and many branches of engineering. The typical audience includes graduate students (Masters and PhD) and advanced undergraduates in Computer Science, Applied Math, Math, and other CEAS departments.

Announcements:

12/17: I will have the graded HW7 papers on Monday. Feel free to pick them up from my office.
Ashish has provided summaries/averages of HW grading on each assignment: Summary comments
The final exam is Thursday, Dec 20, at 2pm-4:30pm in ESS 069 (the usual classroom). It is closed book, closed notes, except that you may bring a single 2-sided page of notes (8.5 by 11 inch) that YOU prepare.
Sample projects (one in Java, one in Visual C++) done previously by students are posted below.
Our TA, Ashish Lohia (ashishl@cs.sunysb.edu), has usual office hours Thursday, 12:00-2:00 in CS 2110.
There is an exciting special topics course by George Hart, CSE391, for those interested in algorithms for 3D design and building cool items with 3D printers, etc. See the course web page. Grads can participate by enrolling as a special projects course with a 500 number.
Room change: We will meet in Earth and Space Science 069 (instead of Humanities 3019)
PLEASE COME TO THE FIRST CLASS MEETING, EVEN IF YOU ARE NOT SURE THAT YOU WANT TO TAKE THE COURSE OR SIT IN ON IT: I will give an overview of what the course is about, etc, which will greatly help you to decide.
Even if the SOLAR system claims the course is "Full", I expect that everyone who wants to take the course will be able to do so.
Lots of information about what computational geometry is all about can be found at Jeff Erickson's Geometry Page.

Main Course Information

Course Information (AMS 545), Fall 2007 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

Photos of lectures on chalkboard, courtesy of Leif Walsh.

Homeworks and Other Handouts

Miscellaneous Links of Relevance:

Required textbook, by de Berg, van Kreveld, Overmars, and Schwartzkopf (2nd 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)