Discrete & Computational Geometry, Volume 14

Volume 14, Number 1, 1995

• Gábor Fejes Tóth:
  Densest Packing of Typical Convex Sets are Nont Lattice-Like. 1-8
  
• Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
  Piecewise Linear Paths Among Convex Obstacles. 9-29
  
• Le Tu Quoc Thang:
  Local Rules for Pentagonal Quasi-Crystals. 31-70
  
• Andrei Gabrielov, Nicolai Vorobjov:
  Complexity of Stratifications of Semi-Pfaffian Sets. 71-91
  
• Tamal K. Dey, Haijo Schipper:
  A New Technique To Compute Polygonal Schema for 2-Manifolds with Application to Null-homotopy Detection. 93-110
  

Volume 14, Number 2, 1995

• Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir:
  Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. 113-122
  
• Zheng-Xu He, O. Schramm:
  Hyperbolic and Parabolic Packings. 123-149
  
• Gabriel Robins, Jeffrey S. Salowe:
  Low-Degree Minimum Spanning Trees. 151-165
  
• Peter Boyvalenkov:
  Extremal Polynomials for Obtaining Bounds for Spherical Codes and Designs. 167-183
  
• Alfredo García Olaverri, Javier Tejel:
  The Order of Points on the Second Convex Hull of a Simple Polygon. 185-205
  
• Nicolau C. Saldanha, Carlos Tomei, M. A. Casarin Jr., D. Romualdo:
  Spaces of Domino Tilings. 207-233
  

Volume 14, Number 3, 1995

• Neil J. A. Sloane, Ronald H. Hardin, T. D. S. Duff, John H. Conway:
  Minimal-Energy Clusters of Hard Spheres. 237-259
  
• Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf:
  On Lazy Randomized Incremental Construction. 261-286
  
• János Kincses:
  On Polytopes Cut by Flats. 287-294
  
• N. Prabhu:
  Facet-Reducing Cuts of a Convex Polytope. 295-300
  
• N. Prabhu:
  Hamiltonian Simple Polytopes. 301-304
  
• Gábor Hetyei:
  On the Stanley Ring of a Cubical Complex. 305-330
  
• James Abello, Ömer Egecioglu, Krishna Kumar:
  Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains. 331-358
  
• J. C. Lagarias, David Moews:
  Acknowledgment of Priority Concerning Polytopes that Fill Rⁿ and Scissors Congruence. 359-360
  

Volume 14, Number 4, 1995

• Kurt Mehlhorn:
  Guest Editor's Foreword. 363
  
• Jirí Matousek:
  On Geometric Optimization with Few Violated Constraints. 365-384
  
• Dan Halperin, Micha Sharir:
  Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. 385-410
  
• Marshall W. Bern, Scott A. Mitchell, Jim Ruppert:
  Linear-Size Nonobtuse Triangulation of Polygons. 411-428
  
• Bernard Chazelle, Nadia Shouraboura:
  Bounds on the Size of Tetrahedralizations. 429-444
  
• Michael T. Goodrich:
  Efficient Piecewise-Linear Function Approximation Using the Uniform Metric. 445-462
  
• Hervé Brönnimann, Michael T. Goodrich:
  Almost Optimal Set Covers in Finite VC-Dimension. 463-479
  

Last update Fri May 24 20:15:24 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page