Sommaire

Penny-Packing and Two-Dimensional Codes.

Sloane, N.J.A. ; Graham, R.L.

Access to full text
p. 1-12

Göttinger Digitalisierungszentrum
Geometry of the Gass-Saaty Parametric Cost LP Algorithm.

Klee, V. ; Kleinschmidt, P.

Access to full text
p. 13-26

Göttinger Digitalisierungszentrum
Upper Bounds on Geometric Permutations for Convex Sets.

Wenger, R.

Access to full text
p. 27-34

Göttinger Digitalisierungszentrum
The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n - 2*.

Edelsbrunner, H. ; Sharir, M.

Access to full text
p. 35-42

Göttinger Digitalisierungszentrum
An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space.

Kedem, K. ; Sharir, M.

Access to full text
p. 43-76

Göttinger Digitalisierungszentrum
On a Problem About Covering Lines by Squares.

Kern, W. ; Wanka, A.

Access to full text
p. 77-82

Göttinger Digitalisierungszentrum
Combinatorial Geometries Representable over GF(3) and GF(q). I. The Number of Points.

Kung, J.P.S.

Access to full text
p. 83-95

Göttinger Digitalisierungszentrum
Editors' Foreword.

Goodman, J.E. ; Pollack, R.

Access to full text
p. 97-98

Göttinger Digitalisierungszentrum
Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.

Edelsbrunner, H. ; Welzl, E. ; Guibas, L.J. ; Clarkson, K.L. ; Sharir, M.

Access to full text
p. 99-160

Göttinger Digitalisierungszentrum
The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.

Edelsbrunner, H. ; Guibas, L.J. ; Sharir, M.

Access to full text
p. 161-196

Göttinger Digitalisierungszentrum
The Complexity of Many Cells in Arrangements of Planes and Related Problems.

Edelsbrunner, H. ; Guibas, L.J. ; Sharir, M.

Access to full text
p. 197-216

Göttinger Digitalisierungszentrum
An Inequality for the Volume of Inscribed Ellipsoids.

Khachiyan, L.G.

Access to full text
p. 219-222

Göttinger Digitalisierungszentrum
Reconstructing Plane Sets from Projections.

Bianchi, G. ; Longinetti, M.

Access to full text
p. 223-242

Göttinger Digitalisierungszentrum
A New Duality Result Concerning Voronoi Diagrams.

Aurenhammer, F.

Access to full text
p. 243-254

Göttinger Digitalisierungszentrum
On the Existence of Certain Smooth Toric Varieties.

Sturmfels, B. ; Kleinschmidt, P. ; Gretenkort, J.

Access to full text
p. 255-262

Göttinger Digitalisierungszentrum
Hyperplane Arrangements with a Lattice of Regions.

Björner, A. ; Edelman, P.H. ; Ziegler, G.M.

Access to full text
p. 263-288

Göttinger Digitalisierungszentrum
Computing Simple Circuits from a Set of Line Segments.

Rappaport, D. ; Imai, H. ; Toussaint, G.T.

Access to full text
p. 289-304

Göttinger Digitalisierungszentrum
Exterior Algebra and Projections of Polytopes.

Filliman, P.

Access to full text
p. 305-322

Göttinger Digitalisierungszentrum
Countable Decompositions of R2 and R3 .

Erdös, P. ; Komjàth, P.

Access to full text
p. 325-332

Göttinger Digitalisierungszentrum
Nonrealizability Proofs in Computational Geometry.

Sturmfels, B. ; Bokowski, J. ; Richter, J.

Access to full text
p. 333-350

Göttinger Digitalisierungszentrum
Diameter and Radius in the Manhattan Metric.

Kleitman, D.J. ; Du, D.Z.

Access to full text
p. 351-356

Göttinger Digitalisierungszentrum
On Convex Bodies that Permit Packings of High Density.

Groemer, H.

Access to full text
p. 357-364

Göttinger Digitalisierungszentrum
A New Approach to the Dynamic Maintenance of Maximal Points in a Plane.

Frederickson, G.N. ; Rodger, S.

Access to full text
p. 365-374

Göttinger Digitalisierungszentrum
A Combinatorial Property of Points and Ellipsoids.

Larman, D.G. ; Bàràny, I.

Access to full text
p. 375-382

Göttinger Digitalisierungszentrum
A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets.

Wenger, R.

Access to full text
p. 383-388

Göttinger Digitalisierungszentrum
Double-Lattice Packings of Convex Bodies in the Plane.

Kuperberg, W. ; Kuperberg, G.

Access to full text
p. 389-398

Göttinger Digitalisierungszentrum
Delaunay Graphs Are Almost as Good as Complete Graphs.

Dobkin, D.P. ; Friedman, S.J. ; Supowit, K.J.

Access to full text
p. 399-408

Göttinger Digitalisierungszentrum
On the Modality of Convex Polygons.

Abrahamson, K.

Access to full text
p. 409-420

Göttinger Digitalisierungszentrum
Guest Editor's Foreword.

Sharir, M.

Access to full text
p. 423-426

Göttinger Digitalisierungszentrum
Construction of e-Nets.

Matousek, J.

Access to full text
p. 427-448

Göttinger Digitalisierungszentrum
Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.

Agarwal, P.K.

Access to full text
p. 449-484

Göttinger Digitalisierungszentrum
Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling.

Paterson, M.S. ; Yao, F.F.

Access to full text
p. 485-504

Göttinger Digitalisierungszentrum
Triangulating a Nonconvex Polytope.

Chazelle, B. ; Palios, L.

Access to full text
p. 505-526

Göttinger Digitalisierungszentrum
Convex Disks Can Cover Their Shadow.

Kós, G. ; Töröcsik, J.

Access to full text
p. 529-532

Göttinger Digitalisierungszentrum
Partitioning Arrangements of Lines, II: Applications.

Agarwal, P.K.

Access to full text
p. 533-574

Göttinger Digitalisierungszentrum
Toughness and Delaunay Triangulations.

Dillencourt, M.B.

Access to full text
p. 575-602

Göttinger Digitalisierungszentrum
Wv Paths on the Torus.

Barnette, D.W.

Access to full text
p. 603-608

Göttinger Digitalisierungszentrum