Computational Geometry, Volume 28

Volume 28, Number 1, May 2004

• Hazel Everett, Stephen K. Wismath:
  Editorial. 1-
  
• Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann:
  Convexity minimizes pseudo-triangulations. 3-10
  
• Prosenjit Bose, Joachim Gudmundsson, Pat Morin:
  Ordered theta graphs. 11-18
  
• Mirela Damian:
  Exact and approximation algorithms for computing optimal fat decompositions. 19-27
  
• Erik D. Demaine, John Iacono, Stefan Langerman:
  Proximate point searching. 29-40
  
• Benjamin Marlin, Godfried T. Toussaint:
  Constructing convex 3-polytopes from two triangulations of a polygon. 41-47
  
• Joseph O'Rourke, Geetika Tewari:
  The structure of optimal partitions of orthogonal polygons into fat rectangles. 49-71
  

Volume 28, Number 2-3, June 2004

• Chandrajit L. Bajaj:
  Editorial. 73-
  
• René van Oostrum, Remco C. Veltkamp:
  Parametric search made practical. 75-88
  
• Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu:
  A local search approximation algorithm for k-means clustering. 89-112
  
• Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson:
  Box-trees for collision checking in industrial installations. 113-135
  
• Pankaj K. Agarwal, Leonidas J. Guibas, An Thai Nguyen, Daniel Russel, Li Zhang:
  Collision detection for deforming necklaces. 137-163
  
• David Goldberg, Christopher Malon, Marshall W. Bern:
  A global approach to automatic solution of jigsaw puzzles. 165-174
  
• Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir:
  Visibility preserving terrain simplification-- an experimental study. 175-190
  
• Démian Nave, Nikos Chrisochoides, L. Paul Chew:
  Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains. 191-215
  
• David Cohen-Steiner, Éric Colin de Verdière, Mariette Yvinec:
  Conforming Delaunay triangulations in 3D. 217-233