Journal: Comput. Geom.

Volume 35, Issue 3

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

Volume 35, Issue 1-2

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