Volume 8,
1992
- Robert Ammann, Branko Grünbaum, G. C. Shephard:
Aperiodic Tiles.
1-25
- Vladimir G. Boltyanski:
A New Step in the Solution of the Szökefalvi-Nagy Problem.
27-49
- Jean-Daniel Boissonnat, Olivier Devillers, René Schott, Monique Teillaud, Mariette Yvinec:
Applications of Random Sampling to On-line Algorithms in Computational Geometry.
51-71
- Timothy Law Snyder:
Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions.
73-92
- Amos Altshuler, Ulrich Brehm:
Neighborly Maps with Few Vertices.
93-104
- John H. Conway, Neil J. A. Sloane:
On the Covering Multiplicity of Lattices.
109-130
- Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack:
An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon.
131-152
- Ulrich Brehm:
Nonuniqueness Results for X-Ray Problems with Point Sources.
153-169
- P. G. Doyle, J. C. Lagarias, Dana Randall:
Self-Packing of Centrally Symmetric Convex Bodies in R2.
171-189
- Marco Pellegrini, Peter W. Shor:
Finding Stabbing Lines in 3-Space.
191-208
- Paul H. Edelman:
On the Average Number of k-Sets.
209-213
- Boris Aronov, Joseph O'Rourke:
Nonoverlap of the Star Unfolding.
219-250
- Claire Kenyon, Richard Kenyon:
How to Take Short Cuts.
251-264
- Clyde L. Monma, Subhash Suri:
Transitions in Geometric Minimum Spanning Trees.
265-293
- David Avis, Komei Fukuda:
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
295-313
- Jirí Matousek:
Efficient Partition Trees.
315-334
- Ketan Mulmuley, Sandeep Sen:
Dynamic Point Location in Arrangement of Hyperplanes.
335-360
- Gil Kalai:
Upper Bounds for the Diameter and Height of Graphs of Convex Polyhedra.
363-372
- Seth M. Malitz, Jerome I. Malitz:
A Bounded Compactness Theorem for L1 - Embed ability of Metric Spaces in the Plane.
373-385
- Robert M. Erdahl:
A Cone of Inhomogeneous Second-Order Polynomials.
387-416
- R. J. Gardner, Michael Kallay:
Subdivision Algorithms and the Kernel of a Polyhedron.
417-427
- Brett T. Garrett:
Circle Packing and Polyhedral Surfaces.
429-440
Copyright © Thu Dec 24 17:11:49 2009
by Michael Ley (ley@uni-trier.de)
