AMS 545/ CSE 555 Course Material, Spring 2017
Joe Mitchell, Math Tower P-139A, 632-8366
The course meets Tues/Thurs 2:30pm-3:50pm in Frey Hall 309.
All ARE Welcome!
Office Hours for Joe: Tues (10:00-11:00), Wed (2:30-4:00), or by appointment, or
drop by whenever (don't be shy!)
YOU SHOULD DEFINITELY COME TO THE FIRST CLASS MEETING (Tues, Jan 24) if you think you
MAY be interested in taking the course! I will be giving a detailed
overview of the course and what to expect, etc.
Even if the course gets "closed", I hope to be able to sign in
the maximum possible number of students, possibly looking for a larger
room, as needed.
Main Course Information
Course Information (AMS 545/CSE 555, Spring 2017) This is the main
course information sheet with details about exams, homeworks, grading, etc.
Homeworks, handouts will be posted on Blackboard.
Lots of information about what computational geometry
is all about can be found at
Jeff Erickson's Geometry Page.
Homeworks and Other Handouts
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, 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
CG Tutorial, with applets
Geometry software, part of
VisLibility, a library of free C++ source code for visibility computations
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
Convex hull algorithm applets, with cool Java applets for
Graham's scan, Jarvis' march, and Quick hull
Duality Viewer Applet, for seeing things in primal/dual planes
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)