Geodesic

On Lattices with Möbius Function ±1, 0.
p. 1-8
Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams.
p. 9-32
A Reduction of Lattice Tiling by Translates of a Cubical Cluster.
p. 33-36
A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.
p. 37-48
A Criterion for the Affine Equivalence of Cell Complexes in Rd and Convex Polyhedra in Rd+1 .
p. 49-64
Steiner Minimal Trees for Regular Polygons.
p. 65-84
On Nonnegative Solutions of Random Systems of Linear Inequalities.
p. 85-96
Guest Editor's Introduction.
p. 97-98
Triangulating Point Sets in Space.
p. 99-112
Linear Space Data Structures for Two Types of Range Search.
p. 113-126
e-Nets and Simplex Range Queries.
p. 127-152
Storing the Subdivision of a Polyhedral Surface.
p. 153-174
Computing Convolutions by Reciprocal Search.
p. 175-194
New Applications of Random Sampling in Computational Geometry.
p. 195-222
Tessellations Generated by Hyperplanes.
p. 223-232
Generating Closed 2-Cell Embeddings in the Torus and the Projective Plane.
p. 233-248
Direction Trees.
p. 249-254
On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space.
p. 255-270
...-Morphic Sets of Prototiles.
p. 271-296
Balanced Subdivision and Enumeration in Balanced Spheres.
p. 297-318
Computing the Volume is Difficult.
p. 319-326
A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.
p. 327-344
A Power Law for the Distortion of Planar Sets.
p. 345-352
Finite Coverings by Translates of Centrally Symmetric Convex Domains.
p. 353-364
An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
p. 365-394
Invertible Relations on Polytopes.
p. 395-400
Steiner Minimal Trees on Sets of Four Points.
p. 401-414