Discrete & Computational Geometry, Volume 18

Volume 18, Number 1, 1997

• Jirí Matousek:
  A Helly-Type Theorem for Unions of Convex Sets. 1-12
  
• Branko Grünbaum:
  Isogonal Prismatoids. 13-52
  
• J. C. Lagarias, N. Prabhu, James A. Reeds:
  The d-Step Conjecture and Gaussian Elimination. 53-82
  
• Phillip G. Bradford, Vasilis Capoyleas:
  Weak epsilon-Nets for Points on a Hypersphere. 83-91
  
• Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky:
  Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. 93-109
  
• Kari J. Nurmela, Patric R. J. Östergård:
  Packing up to 50 Equal Circles in a Square. 111-120
  

Volume 18, Number 2, 1997

• Micha Sharir:
  A Near-Linear Algorithm for the Planar 2-Center Problem. 125-134
  
• Thomas C. Hales:
  Sphere Packings, II. 135-149
  
• T. J. Richardson:
  Approximation of Planar Convex Sets from Hyperplane Probes. 151-177
  
• Boris D. Lubachevsky, Ronald L. Graham:
  Curved Hexagonal Packings of Equal Disks in a Circle. 179-194
  
• Tomás Kaiser:
  Transversals of d-Intervals. 195-203
  
• Alexander I. Barvinok:
  Computing Mixed Discriminants, Mixed Volumes, and Permanents. 205-237
  
• Jeff Erickson, Raimund Seidel:
  Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies. 239-240
  

Volume 18, Number 3, 1997

• Leonidas J. Guibas:
  Guest Editor's Foreword. 245-245
  
• Gyula Károlyi, János Pach, Géza Tóth:
  Ramsey-Type Results for Geometric Graphs, I. 247-255
  
• Stefan Felsner:
  On the Number of Arrangements of Pseudolines. 257-267
  
• Otfried Schwarzkopf, Micha Sharir:
  Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces. 269-288
  
• Matthew Dickerson, J. Mark Keil, Mark H. Montague:
  A Large Subgraph of the Minimum Weight Triangulation. 289-304
  
• Jonathan Richard Shewchuk:
  Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates. 305-368
  

Volume 18, Number 4, 1997

• László Lovász, János Pach, Mario Szegedy:
  On Conway's Thrackle Conjecture. 369-376
  
• Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell:
  An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. 377-383
  
• Victor Klee, T. Lewis, Balder Von Hohenbalken:
  Appollonius Revisited: Supporting Spheres for Sundered Systems. 385-395
  
• Michael T. Goodrich, Edgar A. Ramos:
  Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming. 397-420
  
• Dmitry N. Kozlov:
  Convex Hulls of f- and $\beta$-Vectors. 421-431
  
• Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap:
  Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. 433-454
  
• Ulrich Kortenkamp:
  Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope. 455-462
  
• Tor Gulliksen, Arne Hole:
  On the Number of Linearly Separable Subsets of Finite Sets in Rn. 463-472