Geodesic

Volume 6 (1991) no. 4

Sommaire

An On-Line Potato-Sack Theorem.
p. 1-8
Shortest Watchman Routes in Simple Polygons.
p. 9-32
A New Index for Polytopes.
p. 33-48
Theorems on the Existence of Separating Surfaces.
p. 49-56
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
p. 57-68
Analytic Formulas for Full Steiner Trees.
p. 69-82
Convex Polytopes Whose Projection Bodies and Difference Sets Are Polars.
p. 83-92
The Densest Packing of Equal Circles into a Parallel Strip.
p. 95-106
A Dimension Series for Multivariate Splines.
p. 107-128
Minimum Ideal Triangulations of Hyperbolic 3-Manifolds.
p. 135-154
A Jordan Surface Theorem for Three-Dimensional Digital Spaces.
p. 155-162
Constraints on the Angular Distribution of the Zeros of a Polynomial of Low Complexity.
p. 163-170
On Two Conjectures of Franz Hering About Convex Surfaces.
p. 171-180
Disks with Special Properties of Densest Packings.
p. 181-190
Bounding the Number of Connected Components of a Real Algebraic Set.
p. 191-210
On the Construction of Abstract Voronoi Diagrams.
p. 211-224
On the Global Structure of Crystalline Surfaces.
p. 225-262
Bisectors of Linearly Separable Sets.
p. 263-276
Maximum Density Space Packing with Parallel Strings of Spheres.
p. 277-284
A Simple and Relatively Efficient Triangulation of the n-Cube.
p. 287-290
On the Convex Hull of Uniform Random Points in a Simple d-Polytope.
p. 291-306
On Levels in Arrangements and Voronoi Diagrams.
p. 307-338
On Graver's Conjecture Concerning the Rigidity Problem of Graphs.
p. 339-342
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.
p. 343-368
A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.
p. 369-382
Cutting Hyperplane Arrangements.
p. 385-406
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
p. 407-422
Small-Dimensional Linear Programming and Convex Hulls Made Easy.
p. 423-434
Points and Triangles in the Plane and Halving Planes in Space.
p. 435-442
Some Provably Hard Crossing Number Problems.
p. 443-460
An Exact Algorithm for Kinodynamic Planning in the Plane.
p. 461-484
Triangulating a Simple Polygon in Linear Time.
p. 485-524
Disjoint Homotopic Paths and Trees in a Planar Graph.
p. 527-574
On Translating One Polyomino To Tile the Plane.
p. 575-592
On k-Sets in Arrangements of Curves and Surfaces.
p. 593-613