In addition to the textbook,
papers assigned as reading for the course will be posted here.
Diagrams - Computational Geometry's Favorite,
Foundations of Information Processing of TELEMATIK, 1:4-6, 2002.
||a brief overview of different types of Voronoi diagrams,
their applications, and algorithms for constructing them
||Bose, Devroye, Löffler, Snoeyink, Verma,
ratio of the Delaunay triangulation is greater than π/2,
||assigned reading on a recent result
regarding the spanning ratio of the Delaunay triangulation
Range searching, Handbook of Discrete and Computational Geometry,
2nd edition, 2004
||Section 36.2 in this survey on range searching is assigned reading
|Kinetic Data Structures
In Handbook of Discrete and Computational Geometry, Goodman and O'Rourke, Eds.,
2nd Ed., Chapman and Hall/CRC, 2004, pp. 1117-1134.
||assigned reading: an overview of kinetic data structures