An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane S. KapoorS. N. MaheshwariJ. S. B. Mitchell Pages: 377 - 383
Appollonius Revisited: Supporting Spheres for Sundered Systems V. KleeT. LewisB. Von Hohenbalken Pages: 385 - 395
Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming M. T. GoodrichE. A. Ramos Pages: 397 - 420
Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams T. M. ChanJ. SnoeyinkChee-Keng Yap Pages: 433 - 454
Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope U. H. Kortenkamp Pages: 455 - 462
On the Number of Linearly Separable Subsets of Finite Sets in R n T. GulliksenA. Hole Pages: 463 - 472