Geodesic

Covering a Square by Small Perimeter Rectangles.
p. 1-8
Two Poset Polytopes.
p. 9-24
Voroni Diagrams and Arrangements.
p. 25-44
Can You Cover Your Shadows?
p. 45-58
On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles.
p. 59-72
Covering the Plane with Convex Polygons.
p. 73-82
Halfspace Range Search: An Algorithmic Application of k-Sets.
p. 83-94
More on k-Sets of Finite Sets in the Plane.
p. 95-100
A Resolution of the Sylvester-Gallai Problem of J.-P. Serre.
p. 101-104
Computing Circular Separability.
p. 105-114
Spherical Complexes and Nonprojective Tone Varieties.
p. 115-122
Smooth, Easy to Compute Interpolating Splines.
p. 123-140
Geometric Realizations for Dyck's Regular Map on a Surface of Genus 3.
p. 141-154
A Polynomial Solution for the Potato-peeling Problem.
p. 155-182
Some Basic Properties of Packing and Covering Constants.
p. 183-193
On Polyhedra with Transitivity Properties.
p. 195-200
Generalized Delaunay Triangulation for Planar Graphs.
p. 201-218
Upper Bounds for Configurations and Polytopes in Rd
p. 219-228
On the Cone of Nonnegative Circuits.
p. 229-240
Approximation of Convex Discs by Polygons.
p. 241-264
Diameter Partitioning.
p. 265-276
Periodic Orbits for Additive Cellular Automata.
p. 277-288
A Geometric Inequality and the Complexity of Computing Volume.
p. 289-292
On the Coordinatization of Oriented Matroids.
p. 293-306
Densest Packing of Translates of the Union of Two Circles.
p. 307-314
Random Polytopes in the d- Dimensional Cube.
p. 315-320
A Unified Approach to Visibility Representations of Planar Graphs.
p. 321-342
Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs.
p. 343-354
The Weakly Neighborly Polyhedral Maps on the 2-Manifold with Euler Characteristic -1.
p. 355-370
Geometric Permutations and Common Transversals.
p. 371-378
On Squashed Designs.
p. 379-390