Journal: Comput. Geom.

Volume 31, Issue 3

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

Volume 31, Issue 1-2

1 -- 0David M. Mount. Editorial
3 -- 30John Hershberger. Smooth kinetic maintenance of clusters
31 -- 61Ruth 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
63 -- 100Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos. Curve reconstruction from noisy samples
101 -- 125Jeff Erickson. Local polyhedra and geometric graphs
127 -- 148Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang. Cost-driven octree construction schemes: an experimental study