Volume 5,
1990
- Ronald L. Graham, Neil J. A. Sloane:
Penny-Packing and Two-Dimensional Codes.
1-11
- Victor Klee, Peter Kleinschmidt:
Geometry of the Gass-Saaty Parametric Cost LP Algorithm.
13-26
- Rephael Wenger:
Upper Bounds on Geometric Permutations for Convex Sets.
27-33
- Herbert Edelsbrunner, Micha Sharir:
The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n-2.
35-42
- Klara Kedem, Micha Sharir:
An Efficient Motion-planning Algorithm for a Convex Polygonal Object in Two Dimensional Polygonal Space.
43-75
- Walter Kern, Alfred Wanka:
On a Problem About Covering Lines by Squares.
77-82
- Joseph P. S. Kung:
Combinatorial Geometries Representable over GF(3) and GF(q). I. The Number of Points.
83-95
- Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Combinatorial Complexity Bounds for Arrangement of Curves and Spheres.
99-160
- Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments.
161-196
- Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The Complexity of Many Cells in Arrangements of Planes and Related Problems.
197-216
- Leonid Khachiyan:
An Inequality for the Volume of Inscribed Ellipsoids.
219-222
- Gabriele Bianchi, Marco Longinetti:
Reconstructing Plane Sets from Projections.
223-242
- Franz Aurenhammer:
A New Duality Result Concerning Voronoi Diagrams.
243-254
- Jörg Gretenkort, Peter Kleinschmidt, Bernd Sturmfels:
On the Existence of Certain Smooth Toric Varieties.
255-262
- Anders Björner, Paul H. Edelman, Günter M. Ziegler:
Hyperplane Arrangements with a Lattice of Regions.
263-288
- David Rappaport, Hiroshi Imai, Godfried T. Toussaint:
Computing Simple Circuits form a Set of Line Segments.
289-304
- P. Filliman:
Exterior Algebra and projections of Polytopes.
305-322
- Paul Erdös, Péter Komjáth:
Countable Decompositions of R2 and R3.
325-331
- Jürgen Bokowski, Jürgen Richter, Bernd Sturmfels:
Nonrealizability Proofs in Computational Geometry.
333-350
- Ding-Zhu Du, Daniel J. Kleitman:
Diameter and Radius in the Manhattan Metric.
351-356
- H. Groemer:
On Convex Bodies that Permit Packings of High Density.
357-364
- Greg N. Frederickson, Susan H. Rodger:
A New Approach to the Dynamic Maintaince of Maximal Points in a Plane.
365-374
- Imre Bárány, D. G. Larman:
A Combinatorial Property of Points anf Ellipsoids.
375-382
- Rephael Wenger:
A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets.
383-388
- Greg Kuperberg, Wlodzimierz Kuperberg:
Double-Lattice Packings of Convex Bodies in the Plane.
389-397
- David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit:
Delaunay Graphs are almost as Good as Complete Graphs.
399-407
- Karl R. Abrahamson:
On the Modality of Convex Polygons.
409-419
- Jirí Matousek:
Construction of epsilon-Nets.
427-448
- Pankaj K. Agarwal:
Partitioning Arrangements of Lines I: An Efficient deterministic Algorithm.
449-483
- Mike Paterson, F. Frances Yao:
Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling.
485-503
- Bernard Chazelle, Leonidas Palios:
Triangulating a Nonconvex Polytope.
505-526
- Géza Kós, Jenö Töröcsik:
Convex Disks Can Cover Their Shadow.
529-531
- Pankaj K. Agarwal:
Parititoning Arrangements of Lines II: Applications.
533-573
- Michael B. Dillencourt:
Toughness and Delaunary Triangulations.
575-601
- David W. Barnette:
Wv Paths on the Torus.
603-608
Copyright © Tue Dec 15 20:25:54 2009
by Michael Ley (ley@uni-trier.de)
