Volume 6,
1991
- Marek Lassak, Jixian Zhang:
An On-line Potato-Sack Theorem.
1-7 BibTeX
- Wei-pang Chin, Simeon C. Ntafos:
Shortest Watchman Routes in Simple Polygons.
9-31 BibTeX
- Margaret M. Bayer, Andrew Klapper:
A New Index for Polytopes.
33-47 BibTeX
- Michael E. Houle:
Theorems on the Existence of Separating Surfaces.
49-56 BibTeX
- Hiroshi Maehara:
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
57-67 BibTeX
- R. S. Booth:
Analytic Formulas for Full Steiner Trees.
69-82 BibTeX
- Horst Martini:
Convex Polytopes Whose Projection Bodies and Difference Set Are Polars.
83-91 BibTeX
- Zoltán Füredi:
The Densest Packing of Equal Circles into a Parallel Strip.
95-106 BibTeX
- Louis J. Billera, Lauren L. Rose:
A Dimension Series for Multivariate Splines.
107-128 BibTeX
- Jirí Matousek:
Lower Bounds on the Length of Monotone Paths in Arrangement.
129-134 BibTeX
- Colin Adams, William Sherman:
Minimum Ideal Triangulations of Hyperbolic 3-Manifolds.
135-153 BibTeX
- Ralph Kopperman, Paul R. Meyer, Richard G. Wilson:
A Jordan Surface Theorem for Three-Dimensional Digital Spaces.
155-161 BibTeX
- Gilbert Stengel:
Constraints on the Angular Distribution of the Zeros of a Polynomial of Low Complexity.
163-169 BibTeX
- Tudor Zamfirescu:
On Two Conjectures of Franz Hering about Convex Surfaces.
171-180 BibTeX
- Peter Schmitt:
Disks with Special Properties of Densest Packings.
181-190 BibTeX
- Riccardo Benedetti, Francois Loeser, Jean-Jacques Risler:
Bounding the Number of Connected Components of a Real Algebraic Set.
191-209 BibTeX
- Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing:
On the Construction of Abstract Voronoi Diagrams.
211-224 BibTeX
- Jean E. Taylor:
On the Global Structure of Crystalline Surfaces.
225-262 BibTeX
- Lee R. Nackman, Vijay Srinivasan:
Bisectors of Linearly Separable Sets.
263-275 BibTeX
- András Bezdek, Wlodzimierz Kuperberg, E. Makai:
Maximum Density Space Packing with Parallel Strings of Spheres.
277-283 BibTeX
- Mark D. Haiman:
A Simple and Relatively Efficient Triangulation of the n-Cube.
287-289 BibTeX
- Fernando Affentranger, John A. Wieacker:
On the Convex Hull of Uniform Randowm Points in a Simple d-polytope.
291-305 BibTeX
- Ketan Mulmuley:
On Levels in Arrangement and Voronoi Diagrams.
307-338 BibTeX
- Hiroshi Maehara:
On Graver's Conjecture Concerning the Rigidity Problem of Graphs.
339-342 BibTeX
- Rex A. Dwyer:
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.
343-367 BibTeX
- Pravin M. Vaidya:
A sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.
369-381 BibTeX
- Jirí Matousek:
Cutting Hyperplane Arrangements.
385-406 BibTeX
- Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf:
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
407-422 BibTeX
- Raimund Seidel:
Small-Dimensional Linear Programming and Convex Hulls Made Easy.
423-434 BibTeX
- Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner:
Points and Triangles in the Plane and Halving Planes in Space.
435-442 BibTeX
- Daniel Bienstock:
Some Provably Hard Crossing Number Problems.
443-459 BibTeX
- John F. Canny, Ashutosh Rege, John H. Reif:
An Exact Algorithm for Kinodynamic Planning in the Plane.
461-484 BibTeX
- Bernard Chazelle:
Triangulating a Simple Polygon in Linear Time.
485-524 BibTeX
- Alexander Schrijver:
Disjoint Homotopic Paths and Trees in a Planar Graph.
527-574 BibTeX
- Danièle Beauquier, Maurice Nivat:
On Translating One Polyomino to Tile the Plane.
575-592 BibTeX
- Micha Sharir:
On k-Sets in Arrangement of Curves and Surfaces.
593-613 BibTeX
Copyright © Wed Jun 4 19:07:52 2008
by Michael Ley (ley@uni-trier.de)
