CS 860: Class Presentations, Fall 2004

• Brian Ye Qin:
  F. Chin, J. Snoeyink, and C.-A. Wang. Finding the medial axis of a simple polygon in linear time. Proc. 6th Annu. Internat. Sympos. Algorithms Comput., pp. 382--391. Lecture Notes Comput. Sci. 1004, Springer-Verlag, 1995. citeseer page where you can download the paper.
• Ali Taleghani:
  G. Barequet, M. Dickerson, and D. Eppstein, On Triangulating Three-Dimensional Polygons, in Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 38--47, Philadelphia, PA, USA, 1996. citeseer page where you can download the paper.
• Ian Harrower:
  Chazelle, Liu and Magen. Sublinear Geometric Algorithms. STOC 2003.
• Shuai Cheng:
  Timothy Chan, Optimal output-sensitive convex hull algorithms in two and three dimensions, Discrete & Computational Geometry, 16:361-368, 1996.
• Brendan Lucier:
  Nonoverlap of the star unfolding, B. Aronov and J. O'Rourke, Nonoverlap of the star unfolding, Discrete and Computational Geometry, 8:219-250 (1992).
• Mike Cote:
  M. Bern. Compatible tetrahedralizations. Fundam. Inform. 22(4): 371-384 (1995).
• Philip Henderson:
  Chazelle, An optimal algorithm for intersecting 3D convex polyhedra, SIAM Journal on Computing, Vol 21/4, 671-696, 1992.
• Stefanus Du Toit:
  D. Eppstein & J. Erickson, Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Symposium on Computational Geometry, 58-67, 1998.
• Balachandran Chandrasekharan:
  J. Chen and Y. Han, Shortest paths on a polyhedron, International Journal of Computational Geometry and Applications 6, 127-144, 1996.
• Alex Stewart:
  J. Choi, J. Sellen, C. Yap, Approximate Euclidean Path in 3-Space, International Journal Computational Geometry and Applications, 7, 271--295, 1997.