Computational Geometry, Volume 40

Volume 40, Number 1, May 2008

• Christian Wulff-Nilsen:
  Steiner hull algorithm for the uniform orientation metrics. 1-13
  
• Mihai Badoiu, Kenneth L. Clarkson:
  Optimal core-sets for balls. 14-22
  
• Ansgar Grüne, Sanaz Kamali:
  On the density of iterated line segment intersections. 23-36
  
• Sergey Bereg:
  Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs. 37-44
  
• Xuehou Tan:
  A unified and efficient solution to the room search problem. 45-60
  
• Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap:
  Classroom examples of robustness problems in geometric computations. 61-78
  
• Oswin Aichholzer, Clemens Huemer, Hannes Krasser:
  Triangulations without pointed spanning trees. 79-83
  
• Nabil H. Mustafa, Saurabh Ray:
  Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. 84-91
  

Volume 40, Number 2, July 2008

• Franz Aurenhammer:
  Weighted skeletons and fixed-share decomposition. 93-101
  
• Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
  Unfolding Manhattan Towers. 102-114
  
• Kevin Buchin, Tamal K. Dey, Joachim Giesen, Matthias John:
  Recursive geometry of the flow complex and topology of the flow complex filtration. 115-137
  
• Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
  Drawing cubic graphs with at most five slopes. 138-147
  
• Masud Hasan, Anna Lubiw:
  Equiprojective polyhedra. 148-155
  
• Frédéric Chazal, André Lieutier:
  Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees. 156-170
  
• Hee-Kap Ahn, Peter Brass, Chan-Su Shin:
  Maximum overlap and minimum convex hull of two convex polyhedra under translations. 171-177
  

Volume 40, Number 3, August 2008

• Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff:
  Constructing minimum-interference networks. 179-194
  
• Sergio Cabello, José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura:
  Covering point sets with two disjoint disks or squares. 195-206
  
• Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
  Sparse geometric graphs with small dilation. 207-219
  
• Manuel Abellanas, Alfredo García Olaverri, Ferran Hurtado, Javier Tejel, Jorge Urrutia:
  Augmenting the connectivity of geometric graphs. 220-230
  
• Eli Packer:
  Iterated snap rounding with bounded drift. 231-251
  
• Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
  I/O-efficient algorithms for computing planar geometric spanners. 252-271