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