Incremental Constructions con BRIO" N. Amenta, S. Choi, and G. Rote, Proc. 19th Symposium on Computational Geometry (SoCG), 211-219, 2003
"Multi-Pass Geometric Algorithms", T. Chan, E. Chen, Proc. 21st Symposium on Computational Geometry (SoCG), 180-189, 2005
"Tight Degree Bounds for Pseudo-Triangulations of Points" L. Kettner, D. Kirkpatrick, A. Mantler, J. Snoeyink, B. Speckmann, and F. Takeuchi, Computational Geometry: Theory and Applications 25, 1-12, 2003
"Computing the Intersection-Depth of Polyhedra", avid P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri, Algorithmica 9(6): 518-533, 1993
"Geometric Pattern Matching under Euclidean Motion", L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets, Computational Geometry: Theory and Applications 7(1-2), 113-124, 1997
"Cutting a Country for Smallest Square Fit", M. van Kreveld and B. Speckmann, Proc. 13th International Symposium on Algorithms and Computation (ISAAC), LNCS 2518, 91-102, 2002.
"When Can You Fold a Map?" Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, and Steven S. Skiena. Proceedings of the 7th Workshop on Algorithms and Data Structures (WADS 2001), LNCS 2125, 401-413, 2001
"Dense Point Sets Have Sparse Delaunay Triangulations", J. Erickson. 13th SIAM Conf. Discrete Algorithms (SODA), 125-134, 2002.
"Nice Point Sets Can Have Nasty Delaunay Triangulations", J. Erickson, 17th ACM Symp. Computational Geometry (SoCG), 96-105, 2001.

Last modified by Carola Wenk, carola @ cs.utsa.edu ,