Finding effective “force targets” for two-dimensional, multifinger frictional grips Jacob T. SchwartzMicha Sharir OriginalPaper Pages: 1 - 20
Optimal routing algorithms for mesh-connected processor arrays Sanguthevar RajasekaranThanasis Tsantilas OriginalPaper Pages: 21 - 38
Linear-time border-tracing algorithms for quadtrees Robert E. WebberHanan Samet OriginalPaper Pages: 39 - 54
L 1 shortest paths among polygonal obstacles in the plane Joseph S. B. Mitchell OriginalPaper Pages: 55 - 88
A bounded approximation for the minimum cost 2-sat problem Dan GusfieldLeonard Pitt OriginalPaper Pages: 103 - 117
Polynomial-time primal simplex algorithms for the minimum cost network flow problem Donald GoldfarbJianxiu Hao OriginalPaper Pages: 145 - 160
A geometric view of parametric linear programming Ilan AdlerRenato D. C. Monteiro OriginalPaper Pages: 161 - 176
Solving the Euclidean bottleneck matching problem byk-relative neighborhood graphs M. S. ChangC. Y. TangR. C. T. Lee OriginalPaper Pages: 177 - 194
An efficient algorithm for one-step planar compliant motion planning with uncertainty Amy J. Briggs OriginalPaper Pages: 195 - 208
On the parallel-decomposability of geometric problems Mikhail J. AtallahJyh -Jong Tsay OriginalPaper Pages: 209 - 231
There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees Christos LevcopoulosAndrzej Lingas OriginalPaper Pages: 251 - 256
Output-sensitive generation of the perspective view of isothetic parallelepipeds Franco P. PreparataJeffrey Scott VitterMariette Yvinec OriginalPaper Pages: 257 - 283
Editor's foreword special issue on the sixth annual symposium on computational geometry Mikhail J. Atallah EditorialNotes Pages: 343 - 344
Constructing strongly convex hulls using exact or rounded arithmetic Zhenyu LiVictor Milenkovic OriginalPaper Pages: 345 - 364
Simultaneous inner and outer approximation of shapes Rudolf FleischerKurt MehlhornChee Yap OriginalPaper Pages: 365 - 389
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures Helmut AltRudolf FleischerChristian Uhrig OriginalPaper Pages: 391 - 406
Quasi-optimal upper bounds for simplex range searching and new zone theorems Bernard ChazelleMicha SharirEmo Welzl OriginalPaper Pages: 407 - 429
Minimum-link paths among obstacles in the plane Joseph S. B. MitchellGünter RoteGerhard Woeginger OriginalPaper Pages: 431 - 459
Parallel methods for visibility and shortest-path problems in simple polygons Michael T. GoodrichSteven B. ShauckSumanta Guha OriginalPaper Pages: 461 - 486
