1. Finding effective “force targets” for two-dimensional, multifinger frictional grips

   • Jacob T. Schwartz
   • Micha Sharir

   OriginalPaper Pages: 1 - 20

2. Optimal routing algorithms for mesh-connected processor arrays

   • Sanguthevar Rajasekaran
   • Thanasis Tsantilas

   OriginalPaper Pages: 21 - 38

3. Linear-time border-tracing algorithms for quadtrees

   • Robert E. Webber
   • Hanan Samet

   OriginalPaper Pages: 39 - 54

4. L ₁ shortest paths among polygonal obstacles in the plane

   • Joseph S. B. Mitchell

   OriginalPaper Pages: 55 - 88

5. Path-matching problems

   • Sun Wu
   • Udi Manber

   OriginalPaper Pages: 89 - 101

6. A bounded approximation for the minimum cost 2-sat problem

   • Dan Gusfield
   • Leonard Pitt

   OriginalPaper Pages: 103 - 117

7. Line-segment intersection reporting in parallel

   • Christine Rüb

   OriginalPaper Pages: 119 - 144

8. Polynomial-time primal simplex algorithms for the minimum cost network flow problem

   • Donald Goldfarb
   • Jianxiu Hao

   OriginalPaper Pages: 145 - 160

9. A geometric view of parametric linear programming

   • Ilan Adler
   • Renato D. C. Monteiro

   OriginalPaper Pages: 161 - 176

10. Solving the Euclidean bottleneck matching problem byk-relative neighborhood graphs

    • M. S. Chang
    • C. Y. Tang
    • R. C. T. Lee

    OriginalPaper Pages: 177 - 194

11. An efficient algorithm for one-step planar compliant motion planning with uncertainty

    • Amy J. Briggs

    OriginalPaper Pages: 195 - 208

12. On the parallel-decomposability of geometric problems

    • Mikhail J. Atallah
    • Jyh -Jong Tsay

    OriginalPaper Pages: 209 - 231

13. Maximum concurrent flows and minimum cuts

    • C. K. Cheng
    • T. C. Hu

    OriginalPaper Pages: 233 - 249

14. There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees

    • Christos Levcopoulos
    • Andrzej Lingas

    OriginalPaper Pages: 251 - 256

15. Output-sensitive generation of the perspective view of isothetic parallelepipeds

    • Franco P. Preparata
    • Jeffrey Scott Vitter
    • Mariette Yvinec

    OriginalPaper Pages: 257 - 283

16. Optimal parallel detection of squares in strings

    • Alberto Apostolico

    OriginalPaper Pages: 285 - 319

17. Probing a scene of nonconvex polyhedra

    • J. D. Boissonnat
    • M. Yvinec

    OriginalPaper Pages: 321 - 342

18. Editor's foreword special issue on the sixth annual symposium on computational geometry

    • Mikhail J. Atallah

    EditorialNotes Pages: 343 - 344

19. Constructing strongly convex hulls using exact or rounded arithmetic

    • Zhenyu Li
    • Victor Milenkovic

    OriginalPaper Pages: 345 - 364

20. Simultaneous inner and outer approximation of shapes

    • Rudolf Fleischer
    • Kurt Mehlhorn
    • Chee Yap

    OriginalPaper Pages: 365 - 389

21. Approximate motion planning and the complexity of the boundary of the union of simple geometric figures

    • Helmut Alt
    • Rudolf Fleischer
    • Christian Uhrig

    OriginalPaper Pages: 391 - 406

22. Quasi-optimal upper bounds for simplex range searching and new zone theorems

    • Bernard Chazelle
    • Micha Sharir
    • Emo Welzl

    OriginalPaper Pages: 407 - 429

23. Minimum-link paths among obstacles in the plane

    • Joseph S. B. Mitchell
    • Günter Rote
    • Gerhard Woeginger

    OriginalPaper Pages: 431 - 459

24. Parallel methods for visibility and shortest-path problems in simple polygons

    • Michael T. Goodrich
    • Steven B. Shauck
    • Sumanta Guha

    OriginalPaper Pages: 461 - 486