Geodesic

Volume 4 (1989) no. 6

Table of contents

A Nonuniform Matroid Which Violates the Isotopy Conjecture.
p. 1-2
Geometric Optimization and Dp-Completeness.
p. 3-14
Note on Induced Subgraphs of the Unit Distance Graph En.
p. 15-18
Finite Sphere Packing and Sphere Covering.
p. 19-40
Rectilinear Shortest Paths in the Presence of Rectangular Barriers.
p. 41-54
Incidence-Polytopes with Toroidal Cells.
p. 55-74
A Matroid on Hypergraphs, with Applications in Scene Analysis and Geometry.
p. 75-95
Uniform Oriented Matroids Without the Isotopy Property.
p. 97-100
An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.
p. 101-116
Diameter-Extremal Subsets of Spheres.
p. 117-138
The Complexity of Cutting Complexes.
p. 139-182
Sphere-and-Point Incidence Relations in High Dimensions with Applications to Unit Distances and Furthest-Neighbor Pairs.
p. 183-190
Proof of Grünbaum's Conjecture on Common Transversals for Translates.
p. 191-204
An Algorithm for Reconstructing Convex Bodies from Their Projections.
p. 205-238
Cutting Disjoint Disks by Straight Lines.
p. 239-244
The Maximum Size of a Convex Polygon in a Restricted Set of Points in the Plane.
p. 245-252
Some Extremal Results on Circles Containing Points.
p. 253-258
A Combinatorial Result About Points and Balls in Euclidean Space.
p. 259-262
A Note on the Circle Containment Problem.
p. 263-264
On Separating Two Simple Polygons by a Single Translation.
p. 265-278
Helly-Type Theorems for Spheres.
p. 279-286
Disjoint Edges in Geometric Graphs.
p. 287-290
The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis.
p. 291-310
The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.
p. 311-336
The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces.
p. 337-344
On Representing Sylvester-Gallai Designs.
p. 345-348
Embeddings of Graphs in Euclidean Spaces.
p. 349-364
Complexes Whose Boundaries Cannot Be Pushed Around.
p. 365-374
Dissections of Regular Polygons into Triangles of Equal Areas.
p. 375-382
Applications of Random Sampling in Computational Geometry, II.
p. 387-422
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon.
p. 423-432
Implicitly Representing Arrangements of Lines or Segments.
p. 433-466
Quasi-Optimal Range Searching in Spaces of Finite VC-Dimension.
p. 467-490
On the General Motion-Planning Problem with Two Degrees of Freedom.
p. 491-522
On Arrangements of Jordan Arcs with Three Intersections per Pair.
p. 523-540
On the Graph of Large Distances.
p. 541-550
Visibility and Intersection Problems in Plane Geometry.
p. 551-582
A Geometric Realization Without Self-Intersections Does Exist for Dyck's Regular Map.
p. 583-590
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.
p. 591-604
On the Ball Spanned by Balls.
p. 605-610
Computing the Geodesic Center of a Simple Polygon.
p. 611-626
Estimates for the Minimal Width of Polytopes Inscribed in Convex Bodies.
p. 627-635