EECS 6114: Computational
Geometry
Lecture Notes & Research Papers
Note:
Most of these (pdf) articles are optional
reading and are intended to be a source for further exposure to
the respective topics covered
in the course.
LN1 : Melkman:
Linear Time
Algorithm for Convex Hull of Simple Polygons, 1987.
LN3:
Demaine-Patrascu: Tight Bounds
on Dynamic Convex Hulls, SoCG
2007.
LN4:Linear
Programming
[Chapter 3 in "Advanced Algorithms" by Michel X. Goemans, MIT, 1994].
LN5: Geometric Approximation via
Core Sets - A Survey, 2005.
LN6: A PTAS for k-Means Clustering Based on
Weak Coresets [by Feldman et al.], SoCG 2007.
LN7: Elementary Introduction to Modern Convex
Geometry, [by Keith Ball], MSRI, 1997.
(includes a proof of Fritz John's 1948 Löwner-John Ellipsoid
Theorem).
LN9:
Smallest Enclosing Ball of n
Points in
d-Dimensions - approximation scheme, (SODA 2003)
2004.
LN10: Optimal Core Sets for Balls,
[This is an improvement over the
previous paper] 2006.
LN11:
Largest Inscribed Ball of
Polytopes in d-Dimensions - approximation
scheme, SoCG 2006.
LN12: Optimum Coverage of Point Sets by Disks,
SoCG 2006.
LN13: On Khachiyan’s Algorithm for the
Computation of Minimum Volume Enclosing Ellipsoids,
[by Todd-Yıldırım], Discrete Applied Mathematics, 155:13, pp:
1731-1744, August
2007 .
LN14: Triangulating Simple Polygons by
Pseudo-Triangulations, 1988.
LN15:
Triangulating Simple Polygons in
Randomized O(n) time, SoCG 2000.