Computational Geometry, Volume 41

Volume 41, Numbers 1-2, October 2008

• Ioannis Z. Emiris, Leonidas Palios:
  Editorial. 1
  
• Kevin Buchin, Maike Buchin, Carola Wenk:
  Computing the Fréchet distance between simple polygons. 2-20
  
• Stefan Gerdjikov, Alexander Wolff:
  Decomposing a simple polygon into pseudo-triangles and convex polygons. 21-30
  
• Robert L. Scot Drysdale, Günter Rote, Astrid Sturm:
  Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs. 31-47
  
• Esther Moet, Marc J. van Kreveld, A. Frank van der Stappen:
  On realistic terrains. 48-67
  
• Boris Aronov, Mark de Berg, Chris Gray:
  Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. 68-76
  
• Esther Ezra, Micha Sharir, Alon Efrat:
  On the performance of the ICP algorithm. 77-93
  
• Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey:
  Splitting (complicated) surfaces is hard. 94-110
  

Volume 41, Number 3, November 2008

• Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle:
  Reporting flock patterns. 111-125
  
• Afra Zomorodian, Gunnar Carlsson:
  Localized homology. 126-148
  
• Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci, Jack Snoeyink:
  Time-varying Reeb graphs for continuous space-time data. 149-166
  
• Nir Goldschmidt, Dan Gordon:
  The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing. 167-187
  
• Otfried Cheong, Herman J. Haverkort, Mira Lee:
  Computing a minimum-dilation spanning tree is NP-hard. 188-205
  
• Jorge Caravantes, Laureano González-Vega:
  Improving the topology computation of an arrangement of cubics. 206-218
  
• Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop:
  Optimal location of transportation devices. 219-229
  
• Carla Binucci, Walter Didimo, Francesco Giordano:
  Maximum upward planar subgraphs of embedded planar digraphs. 230-246