Computational Geometry, Volume 31

Volume 31, Number 1-2, May 2005

• David M. Mount:
  Editorial. 1-
  Electronic Edition (link) BibTeX
• John Hershberger:
  Smooth kinetic maintenance of clusters. 3-30
  Electronic Edition (link) BibTeX
• Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley:
  Planar minimally rigid graphs and pseudo-triangulations. 31-61
  Electronic Edition (link) BibTeX
• Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos:
  Curve reconstruction from noisy samples. 63-100
  Electronic Edition (link) BibTeX
• Jeff Erickson:
  Local polyhedra and geometric graphs. 101-125
  Electronic Edition (link) BibTeX
• Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang:
  Cost-driven octree construction schemes: an experimental study. 127-148
  Electronic Edition (link) BibTeX

Volume 31, Number 3, June 2005

• Jack Snoeyink:
  Editorial. 149-
  Electronic Edition (link) BibTeX
• Michael Hoffmann:
  A simple linear algorithm for computing rectilinear 3-centers. 150-165
  Electronic Edition (link) BibTeX
• Christian Sohler:
  Fast reconstruction of Delaunay triangulations. 166-178
  Electronic Edition (link) BibTeX
• Stefan Funke, Kurt Mehlhorn, Stefan Näher:
  Structural filtering: a paradigm for efficient and exact geometric programs. 179-194
  Electronic Edition (link) BibTeX
• Ileana Streinu:
  Non-stretchable pseudo-visibility graphs. 195-206
  Electronic Edition (link) BibTeX
• Therese C. Biedl, Anna Lubiw, Julie Sun:
  When can a net fold to a polyhedron? 207-218
  Electronic Edition (link) BibTeX
• Godfried T. Toussaint:
  The Erdös-Nagy theorem and its ramifications . 219-236
  Electronic Edition (link) BibTeX
• Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman:
  Hinged dissection of polyominoes and polyforms. 237-262
  Electronic Edition (link) BibTeX