Computational Geometry, Volume 26

Volume 26, Number 1, August 2003

• Yunhong Zhou, Subhash Suri:
  Geometric permutations of balls with bounded size disparity. 3-20
  
• Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Joseph O'Rourke:
  Pushing blocks is hard. 21-36
  
• Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink:
  Interlocked open and closed linkages with few joints. 37-45
  
• Michael Hoffmann, Csaba D. Tóth:
  Segment endpoint visibility graphs are Hamiltonian. 47-68
  
• Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint:
  Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. 69-79
  
• Éric Colin de Verdière, Michel Pocchiola, Gert Vegter:
  Tutte's barycenter method applied to isotopies. 81-97
  

Volume 26, Number 2, October 2003

• Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
  Guarding scenes against invasive hypercubes. 99-117
  
• Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan:
  A (1+)-approximation algorithm for 2-line-center. 119-128
  
• Hee-Kap Ahn, Otfried Cheong, René van Oostrum:
  Casting a polyhedron with directional uncertainty. 129-141
  
• Subhas C. Nandy, Bhargab B. Bhattacharya:
  On finding an empty staircase polygon of largest area (width) in a planar point-set. 143-171
  
• Ho-Lun Cheng, Herbert Edelsbrunner:
  Area, perimeter and derivatives of a skin curve. 173-192
  

Volume 26, Number 3, November 2003

• Olivier Devillers, Ferran Hurtado, Gyula Károlyi, Carlos Seara:
  Chromatic variants of the Erdsos-CSzekeres theorem on points in convex position. 193-208
  
• Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li:
  Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces. 209-219
  
• Thomas Lewiner, Hélio Lopes, Geovan Tavares:
  Optimal discrete Morse functions for 2-manifolds. 221-233
  
• Michael A. Soss, Jeff Erickson, Mark H. Overmars:
  Preprocessing chains for fast dihedral rotations is hard or even impossible. 235-246
  
• T. S. Michael, Val Pinciu:
  Art gallery theorems for guarded guards. 247-258