Computational Geometry, Volume 35

Volume 35, Numbers 1-2, August 2006

Special Issue on the 20th ACM Symposium on Computational Geometry

Jean-Daniel Boissonnat, Jack Snoeyink:
Editorial. 1
Electronic Edition (link) BibTeX
Jie Gao, Leonidas J. Guibas, An Thai Nguyen:
Deformable spanners and applications. 2-19
Electronic Edition (link) BibTeX
Timothy M. Chan:
Faster core-set constructions and data-stream algorithms in fixed dimensions. 20-35
Electronic Edition (link) BibTeX
Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert:
Exact, efficient, and complete arrangement computation for cubic curves. 36-73
Electronic Edition (link) BibTeX
Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean:
Intersecting quadrics: an efficient and exact implementation. 74-99
Electronic Edition (link) BibTeX
Jyh-Ming Lien, Nancy M. Amato:
Approximate convex decomposition of polygons. 100-123
Electronic Edition (link) BibTeX
Tamal K. Dey, Samrat Goswami:
Provable surface reconstruction from noisy samples. 124-141
Electronic Edition (link) BibTeX

Konstantinos G. Kakoulis, Ioannis G. Tollis:
Algorithms for the multiple label placement problem. 143-161
Electronic Edition (link) BibTeX
Alon Efrat, Stephen G. Kobourov, Anna Lubiw:
Computing homotopic shortest paths efficiently. 162-172
Electronic Edition (link) BibTeX
J. Mark Keil, Tzvetalin S. Vassilev:
Algorithms for optimal area triangulations of a convex polygon. 173-187
Electronic Edition (link) BibTeX
Marc Benkert, Alexander Wolff, Florian Widmann, Takeshi Shirabe:
The minimum Manhattan network problem: Approximations and exact solutions. 188-208
Electronic Edition (link) BibTeX
Timothy M. Chan:
Three problems about simple polygons. 209-217
Electronic Edition (link) BibTeX
Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell:
The minimum-area spanning tree problem. 218-225
Electronic Edition (link) BibTeX