Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Discrete & computational geometry
Tome 14 (1995)
no. 3
Précédent
Volume 14 (1995) no. 3
Sommaire
Densest Packings of Typical Convex Sets Are Not Lattice-Like .
Fejes G. Tóth
p. 1-8
Piecewise Linear Paths Among Convex Obstacles.
J. Matousek
;
O. Schwarzkopf
;
M. de Berg
p. 9-30
Local Rules for Pentagonal Quasi-Crystals.
Le Tu Quoc Thang
p. 31-70
Complexity of Stratifications of Semi-Pfaffian Sets.
A. Gabrielov
;
N. Vorobjov
p. 71-92
A New Technique To Compute Polygonal Schema for 2-Manifolds with Application to Null-Homotopy Detection.
T.K. Dey
;
H. Schipper
p. 93-110
Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions.
L.J. Guibas
;
M. Sharir
;
J. Matousek
;
D. Halperin
p. 113-122
Hyperbolic and Parabolic Packings.
Zheng-Xu He
;
O. Schramm
p. 123-150
Low-Degree Minimum Spanning Trees.
G. Robins
;
J.S. Salowe
p. 151-166
Extremal Polynomials for Obtaining Bounds for Spherical Codes and Designs.
P. Boyvalenkov
p. 167-184
The Order of Points on the Second Convex Hull of a Simple Polygon.
A. Garcia
;
J. Tejel
p. 185-206
Spaces of Domino Tilings.
N.C. Saldanha
;
C. Tomei
;
M.A. Jr. Casarin
;
D. Romualdo
p. 207-234
Minimal-Energy Clusters of Hard Spheres.
J.H. Conway
;
N.J.A. Sloane
;
R.H. Hardin
;
T.D.S. Duff
p. 237-260
On Lazy Randomized Incremental Construction.
O. Schwarzkopf
;
M. de Berg
;
K. Dobrindt
p. 261-286
On Polytopes Cut by Flats.
J. Kincses
p. 287-294
Facet-Reducing Cuts of a Convex Polytope.
N. Prabhu
p. 295-300
Hamiltonian Simple Polytopes.
N. Prabhu
p. 301-304
On the Stanley Ring of a Cubical Complex.
G. Hetyei
p. 305-330
Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.
K. Kumar
;
J. Abello
;
O. Egecioglu
p. 331-358
Acknowledgment of Priority Concerning: Polytopes that Fill R
J.C. Lagarias
;
D. Moews
p. 359-360
On Geometric Optimization with Few Violated Constraints.
J. Matousek
p. 365-384
Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions.
M. Sharir
;
D. Halperin
p. 385-410
Linear-Size Nonobtuse Triangulation of Polygons.
J. Ruppert
;
M. Bern
;
S. Mitchell
p. 411-428
Bounds on the Size of Tetrahedralizations.
B. Chazelle
;
N. Shouraboura
p. 429-444
Efficient Piecewise-Linear Function Approximation Using the Uniform Metric.
M.T. Goodrich
p. 445-462
Almost Optimal Set Covers in Finite VC-Dimension.
M.T. Goodrich
;
H. Brönnimann
p. 463-479