Volume 2,
1987
- Jeff Kahn:
On Lattices with Möbius Function ±1, 0.
1-8 BibTeX
- Daniel Leven, Micha Sharir:
Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams.
9-31 BibTeX
- Sándor Szabó:
A Reduction of Lattice Tiling bz Translates of a Cubical Cluster.
33-36 BibTeX
- Martin Kolinek:
A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.
37-48 BibTeX
- Franz Aurenhammer:
A Criterion for the Affine Equivalence of Cell Complexes in Rd and Convex Polyhedra in Rd+1+.
49-64 BibTeX
- Ding-Zhu Du, Frank K. Hwang, J. F. Weng:
Steiner Minimal Trees for Regular Polygons.
65-84 BibTeX
- Christian Buchta:
On Nonnegative Solutions of Random Systems of Linear Inequalities.
85-95 BibTeX
- David Avis, Hossam A. ElGindy:
Triangulating Point Sets in Space.
99-111 BibTeX
- Bernard Chazelle, Herbert Edelsbrunner:
Linear Space Data Structures for Two Types of Range Search.
113-126 BibTeX
- David Haussler, Emo Welzl:
epsilon-Nets and Simplex Range Queries.
127-151 BibTeX
- David M. Mount:
Storing the Subdivision of a Polyhedral Surface.
153-174 BibTeX
- Leonidas J. Guibas, Raimund Seidel:
Computing Convolutions by Reciprocal Search.
175-193 BibTeX
- Kenneth L. Clarkson:
New Applications of random Sampling in Computational Geometry.
195-222 BibTeX
- Rolf Schneider:
Tessellations Generated by Hyperplanes.
223-232 BibTeX
- David W. Barnette:
Generating Closed 2-Cell Embeddings in the Torus and the Projective Plane.
233-247 BibTeX
- Robert E. Jamison:
Direction Trees.
249-254 BibTeX
- Daniel Leven, Micha Sharir:
On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space.
255-270 BibTeX
- Peter Schmitt:
delta-Morphic Sets of Prototiles.
271-295 BibTeX
- Louis J. Biller, Katherine E. Magurn:
Balanced Subdivision and Enumeration in Balanced Spheres.
297-317 BibTeX
- Imre Bárány, Zoltán Füredi:
Computing the Volume is Difficulte.
319-326 BibTeX
- Ryan B. Hayward:
A Low Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.
327-343 BibTeX
- Michael H. Freedman:
A Power Law for the Distortion of Planar Sets.
345-351 BibTeX
- Gábor Fejes Tóth:
Finite Coverings by Translates of Centrally Symmetric Convex Domains.
353-363 BibTeX
- Chee-Keng Yap:
An O (n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
365-393 BibTeX
- G. T. Sallee:
Invertible Relations on Polytopes.
395-399 BibTeX
- Ding-Zhu Du, Frank K. Hwang, G. D. Song, G. Y. Ting:
Steiner Minimal Trees on Sets of Four Points.
401-414 BibTeX
Copyright © Sat May 16 23:56:31 2009
by Michael Ley (ley@uni-trier.de)
