Volume 35, Numbers 1-2, August 2006

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

Volume 35, Number 3, October 2006

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

last updated on Sun May 26 04:36:39 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page