Discrete & Computational Geometry, Volume 29

Volume 29, Number 1, 2003

• Joel Hass, Jack Snoeyink, William P. Thurston:
  The Size of Spanning Disks for Polygonal Curves. 1-17
  
• Nathan Linial, Michael E. Saks:
  The Euclidean Distortion of Complete Binary Trees. 19-21
  
• Lewis Bowen, Charles Radin:
  Densest Packing of Equal Spheres in Hyperbolic Space. 23-39
  
• Saugata Basu:
  The Combinatorial and Topological Complexity of a Single Cell. 41-59
  
• Satyan L. Devadoss:
  A Space of Cyclohedra. 61-75
  
• Yuri Ilan:
  A Lower Bound on the Distortion of Embedding Planar Metrics into Euclidean Space. 77-81
  
• Olivier Bernard, P. Franco, Philippe Trebuchet:
  Circular Cylinders through Four or Five Points in Space. 83-104
  
• Artur Andrzejak, Emo Welzl:
  In between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions. 105-131
  
• Daniele Micciancio:
  A Note on the Minimal Volume of Almost Cubic Parallelepipeds. 133-138
  
• Iiro S. Honkala, Tero Laihonen:
  On the Identification of Sets of Points in the Square Lattice. 139-152
  
• Mark H. Overmars:
  Finding Sets of Points without Empty Convex 6-Gons. 153-158
  

Volume 29, Number 2, 2003

• Meir Katchalski, Subhash Suri, Yunhong Zhou:
  A Constant Bound for Geometric Permutations of Disjoint Unit Balls. 161-173
  
• J. C. Lagarias, Yang Wang:
  Substitution Delone Sets. 175-209
  
• Michael Farber:
  Topological Complexity of Motion Planning. 211-221
  
• Geoffrey Exoo:
  A Euclidean Ramsey Problem. 223-227
  
• Anita Schöbel:
  Anchored Hyperplane Location Problems. 229-238
  
• Alan Siegel:
  An Isoperimetric Theorem in Plane Geometry. 239-255
  
• Tangan Gao, Tien-Yien Li:
  Mixed Volume Computation for Semi-Mixed Systems. 257-277
  
• R. J. Gardner, Peyman Milanfar:
  Reconstruction of Convex Bodies from Brightness Functions. 279-303
  
• Sergey I. Agafonov:
  Imbedded Circle Patterns with the Combinatorics of the Square Grid and Discrete Painlevé Equations. 305-319
  

Volume 29, Number 3, February 2003

• Robin Forman:
  Bochner's Method for Cell Complexes and Combinatorial Ricci Curvature. 323-374
  
• Timothy M. Chan:
  On Levels in Arrangements of Curves. 375-393
  
• Andreas Holmsen:
  New Bounds on the Katchalski--Lewis Transversal Problem. 395-408
  
• Rick Norwood, George Poole:
  An Improved Upper Bound for Leo Moser's Worm Problem. 409-417
  
• Tamal K. Dey, Joachim Giesen, Samrat Goswami, Wulue Zhao:
  Shape Dimension and Approximation from Samples. 419-434
  
• Michael I. Hartley:
  Quotients of Some Finite Universal Locally Projective Polytopes. 435-443
  
• W. Kimmerle, E. Kouzoudi:
  Doubly Transitive Automorphism Groups of Combinatorial Surfaces. 445-457
  
• Natalie Priebe Frank:
  Detecting Combinatorial Hierarchy in Tilings Using Derived Voronoi Tessellations. 459-467
  
• Aladár Heppes:
  Covering the Plane with Fat Ellipses without Non-Crossing Assumption. 477-481
  

Volume 29, Number 4, May 2003

• Martin Grötschel, Martin Henk:
  The Representation of Polyhedra by Polynomial Inequalities. 485-504
  
• Sinisa T. Vrecica:
  Tverberg's Conjecture. 505-510
  
• Mike Develin, Stephen G. Hartke, David Petrie Moulton:
  A General Notion of Visibility Graphs. 511-524
  
• Jeong-Yup Lee, Robert V. Moody, Boris Solomyak:
  Consequences of Pure Point Diffraction Spectra for Multiset Substitution Systems. 525-560
  
• Valeriu Soltan:
  The Characteristic Intersection Property of Line-Free Choquet Simplices in E^d. 561-573
  
• Rolf Schneider:
  Mixed Polytopes. 575-593
  
• Andreas Holmsen, Meir Katchalski, Ted Lewis:
  A Helly-Type Theorem for Line Transversals to Disjoint Unit Balls. 595-602
  
• Sze-Man Ngai, Nhu Nguyen:
  The Heighway Dragon Revisited. 603-623
  
• Johan Wästlund:
  Perfect Packings of Squares Using the Stack-Pack Strategy. 625-631