GEODESIC
Revues
Séminaires
Livres
Congrès
Sources
Discrete & computational geometry
Tome 8 (1992)
no. 1
Sommaire
Aperiodic Tiles.
G.C. Shephard
;
R. Ammann
;
B Grünbaum
p. 1
A New Step in the Solution of the Szökefalvi-Nagy Problem.
V.G. Boltyanski
p. 27
Applications of Random Sampling to On-Line Algorithms in Computational Geometry.
R. Schott
;
J.D. Boissonnat
;
O. Devillers
;
M. Teillaud
p. 51
Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions.
M. Yvinec
p. 73
Neighborly Maps with Few Vertices.
T. L. Snyder
p. 93
On the Covering Multiplicity of Lattices.
p. 109
An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.
J.H. Conway
;
N.J.A. Sloane
p. 131
Nonuniqueness Results for X-Ray Problems with Point Sources.
H.N. Djidjev
;
A. Lingas
;
J.R. Sack
p. 153
Self-Packing of Centrally Symmetric Convex Bodies in R2 .
U. Brehm
p. 171
Nonoverlap of the Star Unfolding.
H. Edelsbrunner
p. 219
Transitions in Geometric Minimum Spanning Trees.
R. Kenyon
;
C. Kenyon
p. 265
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
S. Suri
;
C. Monma
p. 295
Dynamic Point Location in Arrangements of Hyperplanes.
J. Matousek
p. 335
Upper Bounds for the Diameter and Height of Graphs of Convex Polyhedra.
K. Mulmuley
;
S. Sen
p. 363
A Cone of Inhomogeneous Second-Order Polynomials.
S.M. Malitz
;
J.I. Malitz
p. 387
Subdivision Algorithms and the Kernel of a Polyhedron.
R. Erdahl
p. 417
Circle Packings and Polyhedral Surfaces.
R.J. Gardner
;
M. Kallay
p. 429