Skip to main content
SpringerLink
Log in

Optimal parallel algorithms for rectilinear link-distance problems

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We provide optimal parallel solutions to several link-distance problems set in trapezoided rectilinear polygons. All our main parallel algorithms are deterministic and designed to run on the exclusive read exclusive write parallel random access machine (EREW PRAM). LetP be a trapezoided rectilinear simple polygon withn vertices. InO(logn) time usingO(n/logn) processors we can optimally compute:

  1. 1.

    Minimum réctilinear link paths, or shortest paths in theL 1 metric from any point inP to all vertices ofP.

  2. 2.

    Minimum rectilinear link paths from any segment insideP to all vertices ofP.

  3. 3.

    The rectilinear window (histogram) partition ofP.

  4. 4.

    Both covering radii and vertex intervals for any diagonal ofP.

  5. 5.

    A data structure to support rectilinear link-distance queries between any two points inP (queries can be answered optimally inO(logn) time by uniprocessor).

Our solution to 5 is based on a new linear-time sequential algorithm for this problem which is also provided here. This improves on the previously best-known sequential algorithm for this problem which usedO(n logn) time and space.5 We develop techniques for solving link-distance problems in parallel which are expected to find applications in the design of other parallel computational geometry algorithms. We employ these parallel techniques, for example, to compute (on a CREW PRAM) optimally the link diameter, the link center, and the central diagonal of a rectilinear polygon.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. G. Alexandrav, H. N Djidjev and J.-R. Sack, Finding a Central Link Segment of a Simple Polygon in O(n log n) Time, Technical Report No. SCS-TR-163, Carleton University, 1989.

  2. E. M. Arkin, J. S. B. Mitchell, and S. Suri, Link queries and polygon approximation,Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 269–279.

  3. M. de Berg, On rectilinear link distance,Computation Geometry: Theory and Applications,1 (1991), 13–34.

    Google Scholar 

  4. O. Berkman, B. Schieber; and U. Vishkin, Some Doubly Logarithmic Optimal Parallel Algorithms Based on Finding all Nearest Smaller Values, Technical Report UMIACS-TR-88-79, University of Maryland, 1988.

  5. V. Chandru, S. K. Ghosh, A. Maheshwari, V. T. Rajan, and S. Saluja,NC-algorithms for minimum link path and related problems,Journal of Algorithms (1995), to appear.

  6. B. Chazelle, Triangulating a simply polygon in linear time,Discrete and Computational Geometry,4 (1991), 485–524.

    Google Scholar 

  7. K. L. Clarkson, R. Cole, and R. E. Tarjan, Randomized parallel algorithms for trapezoidal decomposition,Proc. 7th ACM Symposium on Computational Geometry, 1991, pp. 152–161.

  8. K. L. Clarkson, S. Kapoor, and P. M. Vaidya, Rectilinear shortest paths through polygonal obstacles in O(n(log n)2) time,Proc. 3rd ACM Symposium on Computation Geometry, 1987, pp. 251–257.

  9. P. J. de Rezende, D. T. Lee, and Y. F. Wu, Rectilinear shortest paths with rectangular barriers,Discrete and Computational Geometry,4 (1989), 41–53.

    Google Scholar 

  10. H. N. Djidjev, A. Lingas, and J.-R. Sack, AnO(n logn) algorithm for computing the link center of a simple polygon,Discrete and Computational Geometry,8 (1992), 131–152.

    Google Scholar 

  11. S. K. Ghosh, Computing the visibility polygon from a convex set and related problems,Journal of Algorithms,12 (1991), 75–95.

    Google Scholar 

  12. S. K. Ghosh and A. Maheshwari, Parallel algorithms for all minimum link paths and link center problems,SWAT 92, Lecture Notes in Computer Science, Vol. 621, Springer-Verlag, Berlin, 1992, pp. 106–117.

    Google Scholar 

  13. M. T. Goodrich, Planar separators and parallel polygon triangulation,Proc. ACM Symposium on Theory of Computing, 1992, pp. 507–515.

  14. M. T. Goodrich, S. Shauck, and S. Guha, Parallel methods for visibility and shortest path problems in simple polygons,Proc. 6th ACM Symposium on Computational Geometry, 1990, pp. 73–82.

  15. J. Hershberger, Optimal parallel algorithms for triangulated simple polygons,Proc. 8th ACM Symposium on Computational Geometry, 1992, pp. 33–42.

  16. J. JàJà,An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.

    Google Scholar 

  17. R. M. Karp and R. Vijaya Ramachandran, Parallel algorithms for shared-memory machines, inHandbook of Theoretical Computer Science, Vol. 1, J. van Leeuwen, ed. Elsevier, Amsterdam, 1990, pp. 869–941

    Google Scholar 

  18. Y, Ke, An efficient algorithm for link-distance problems,Proc. 5th ACM Symposium on Computational Geometry, 1989, pp. 69–78.

  19. R. Klein and A. Lingas, Manhattonian proximity in a simple polygon,Proc. 8th ACM Symposium on Computational Geometry, 1992, pp. 312–319.

  20. W. Lenhart, R. Pollack, J. -R. Sack, R. Seidel, M. Sharir, S. Suri, G. Toussaint, S. Whitesides, and C. Yap, Computing the link center of a simple polygon,Discrete and Computational Geometry,3 (1988), 281–293.

    Google Scholar 

  21. C. Levcopoulos, On Approximation Behavior of the Greedy Triangulation, Ph.D. thesis, Linköping Studies in Science and Technology No. 74, Linköping University, Sweden, 1986.

    Google Scholar 

  22. C. Levcopoulos and O. Petersson, Matching parenthesis in parallel,Discrete and Applied Mathematics,40 (1992), 423–431.

    Google Scholar 

  23. A. Lingas, A, Maheshwari, and J.-R. Sack, Optimal Parallel Algorithms for Rectilinear Link Distance Problems, Technical Report SCS-TR-213, School of Computer Science, Carleton University, 1992.

  24. K. M. McDonald and J. G. Peters, Smallest paths in simple rectilinear polygons,IEEE Transactions on Computer-Aided Design, 11(7) (1992), 864–875.

    Google Scholar 

  25. B. J. Nilsson and S. Schuierer, An optimal algorithm for the rectilinear link center of a rectilinear polygon,Proc. 2nd Workshop on Algorithms and Data Structures, F. Dehne, J. -R. Sack, and N. Santoro, eds., Springer-Verlag, New York 1991, pp. 249–260.

    Google Scholar 

  26. B. J. Nilsson and S. Schuierer, Computing the rectilinear link diameter of a polygon, inComputational Geometry-Methods, Algorithms, and Applications, Lecture Notes in Computer Science, Vol. 553, H. Noltemeier and H. Bieri, eds., Springer-Verlag, Berlin, 1991, pp. 203–216.

    Google Scholar 

  27. J. O'Rourke,Art Gallery Theorems and Algorithms, Oxford University Press, Oxford, 1987.

    Google Scholar 

  28. J. H. Reif and J. A. Storer, Minimizing turns for discrete movement in the interior of a polygon,IEEE Journal of Robotics and Automation,3 (1987), 182–193.

    Google Scholar 

  29. J. -R. Sack, Rectilinear Computational Geometry, Ph.D. thesis, McGill University, 1984.

  30. B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization,SIAM Journal on Computing,17 (1988), 1253–1262.

    Google Scholar 

  31. S. Schuierer, Rectilinear path queries in a simple rectilinear polygon,STACS'93, Lecture Notes in Computer Science, Vol. 665, Springer-Verlag, Berlin, 1993, pp. 282–293.

    Google Scholar 

  32. S. Suri, A linear time algorithm for minimum link path inside a simple polygon,Computer Vision, Graphics and Image Processing,35 (1986), 99–110.

    Google Scholar 

  33. S. Suri, Minimum Link Paths in Polygons and Related Problems, Ph.D thesis, Johns Hopkins University, 1987.

  34. S. Suri, Computing furthest neighbors in simple polygons,Journal of Computer Science,39 (1989), 220–335.

    Google Scholar 

  35. R. Tamassia and J. S. Vitter, Optimal parallel algorithms for transitive closure and point location in planar structures,Proc. 1st ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 339–408.

  36. R. E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm,SIAM Journal on Computing,14 (1982), 862–874.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Lund University, Box 118, S-22100, Lund, Sweden

    A. Lingas

  2. Computer Systems and Communications Group, Tata Institute of Fundamental Research, Homi Bhabha Road, 400 005, Bombay, India

    A. Maheshwari

  3. School of Computer Science, Carleton University, K1S 5B6, Ottawa, Ontario, Canada

    J. R. Sack

Authors
  1. A. Lingas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Maheshwari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. R. Sack
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by K. Mehlhorn.

This research work was partially supported by TFR. The research of the third author was partially supported by the Natural Sciences and Engineering Council of Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lingas, A., Maheshwari, A. & Sack, J.R. Optimal parallel algorithms for rectilinear link-distance problems. Algorithmica 14, 261–289 (1995). https://doi.org/10.1007/BF01206332

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01206332

Key words

Search

Navigation