Volume 13, Number 1, February 2003

• 
  D. T. Lee: Chief Editor's Notice. 1-2
• 
  Roberto Tamassia: Guest Editor's Foreword. 3-4
• 
  Julien Basch, Harish Devarajan, Piotr Indyk, Li Zhang: Probabilistic Analysis for Discrete Attributes of Moving Points. 5-22
• 
  Konstantinos G. Kakoulis, Ioannis G. Tollis: A Unified Approach to Automatic Label Placement. 23-60
• 
  Jonathan D. Cohen, Dinesh Manocha, Marc Olano: Successive Mappings: An Approach to Polygonal Mesh Simplification with Guaranteed Error Bounds. 61

Volume 13, Number 2, April 2003

• 
  Danny Z. Chen, Ovidiu Daescu: Space-Efficient Algorithms for Approximating Polygonal Curves in Two-Dimensional Space. 95-111
• 
  Jérôme Galtier, Ferran Hurtado, Marc Noy, Stephane Perennes, Jorge Urrutia: Simultaneous Edge Flipping in Triangulations. 113-133
• 
  Danny Z. Chen, Shuang Luan, Jinhui Xu: Topological Peeling and Applications. 135-172
• 
  Eugene Fink, Derick Wood: Planar Strong Visibility. 173-187

Volume 13, Number 3, June 2003

• 
  Jean-Daniel Boissonnat, Sylvain Lazard: A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature AmidstModerate Obstacles. 189-229
• 
  Olivier Devillers, Franco P. Preparata: Culling a Set of Points for Roundness or Cylindricity Evaluations. 231-240
• 
  Kurt Mehlhorn, Michael Seel: Infimaximal Frames: A Technique for Making Lines Look Like Segments. 241-255
• 
  Asish Mukhopadhyay, S. V. Rao: On Computing a Largest Empty Arbitrarily Oriented Rectangle. 257-271
• 
  Joseph O'Rourke: Computational Geometry Column 44. 273-275

Volume 13, Number 4, August 2003

Selected Papers from the International Workshop on Computational Geometry and Applications, Amsterdam, April 2002

• 
  Kokichi Sugihara: Guest Editor's Foreword. 277-
• 
  Marina L. Gavrilova, Jon G. Rokne: Collision Detection Optimization in a Multi-Particle System. 279-301
• 
  Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. 303-316
• 
  José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès: The Largest Empty Annulus Problem. 317-325
• 
  Joachim Giesen, Matthias John, Michel Stöcklin: Symmetry of Flow Diagrams Derived from Weighted Points in the Plane. 327-337
• 
  Maciej Dakowicz, Christopher M. Gold: Extracting Meaningful Slopes from Terrain Contours. 339-357

Volume 13, Number 5, October 2003

• 
  Chandrajit L. Bajaj, Guoliang Xu, Robert J. Holt, Arun N. Netravali: Nurbs Approximation of A-Splines and A-Patches. 359-390
• 
  Olivier Devillers, Regina Estkowski, Pierre-Marie Gandoin, Ferran Hurtado, Pedro A. Ramos, Vera Sacristan: Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction. 391-398
• 
  Tim Culver, John Keyser, Dinesh Manocha, Shankar Krishnan: A Hybrid Approach for Determinant Signs of Moderate-Sized Matrices. 399-417
• 
  Sergei Bespamyatnikh: Computing Closest Points for Segments. 419-438
• 
  Peter Braß, Laura Heinrich-Litan, Pat Morin: Computing the Center of Area of a Convex Polygon. 439-445

Volume 13, Number 6, December 2003

• 
  Prosenjit Bose, Hazel Everett, Stephen K. Wismath: Properties of Arrangement Graphs. 447-462
• 
  Chaim Linhart, Dan Halperin, Iddo Hanniel, Sariel Har-Peled: An Experimental Study of On-Line Methods for Zone Construction in Arrangements of Lines in the Plane. 463-485
• 
  Ashim Garg, Adrian Rusu: Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees. 487-505