Skip to main content
SpringerLink
Log in

Line-segment intersection reporting in parallel

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In this paper we give a parallel algorithm for line-segment intersection reporting in the plane. It runs in timeO(((n +k) logn log logn)/p) usingp processors on a concurrent-read-exclusive-write (CREW)-PRAM, wheren is the number of line segments,k is the number of intersections, andp ≤n +k.

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. A. Aggarwal, B. Chazelle, L. Guibas, C. Ó'Dúnlaing, and C. Yap, Parallel Computational Geometry,Algorithmica 3, 1988, 293–327.

    Article  MATH  MathSciNet  Google Scholar 

  2. M. Atallah and M. Goodrich, Efficient Plane Sweeping in Parallel,Proc. 2nd ACM Symp. on Computational Geometry, 1986, 216–225.

  3. M. Atallah, R. Cole, and M. Goodrich, Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms,SIAM J. Comput. 18, 1989, 499–532.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. L. Bentley and T. Ottmann, Algorithms for Reporting and Counting Geometric Intersections,IEEE Trans. Comput. 28, 1979, 643–647.

    Article  MATH  Google Scholar 

  5. B. Chazelle, Reporting and Counting Segment Intersections,J. Comput. System Sci. 32, 1986, 156–182.

    Article  MATH  MathSciNet  Google Scholar 

  6. B. Chazelle and H. Edelsbrunner, An Optimal Algorithm for Intersecting Line Segments in the Plane,Proc. 29th FOCS, 1988, 590–600.

  7. B. Chazelle and L. J. Guibas, Fractional Cascading I: A Data Structuring Technique,Algorithmica 1, 1986, 133–162.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. Cole, Parallel Merge Sort,SIAM J. Comput. 17, 1988, 770–785.

    Article  MATH  MathSciNet  Google Scholar 

  9. M. Goodrich, Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors,Proc. ACM Symp. on Parallel Algorithms and Architectures, 1989, 127–136.

  10. C. P. Kruskal, Searching, Merging and Sorting in Parallel Computation,IEEE Trans. Comput. 32, 1983, 942–946.

    Article  MATH  MathSciNet  Google Scholar 

  11. R. E. Ladner and M. J. Fischer, Parallel Prefix Computation,J. Assoc. Comput. Mach. 27, 1980, 831–838.

    MATH  MathSciNet  Google Scholar 

  12. K. Mehlhorn,Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, Springer-Verlag, Berlin, 1984.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität des Saarlandes, FB 14, Informatik, W-6600, Saarbrücken, Federal Republic of Germany

    Christine Rüb

Authors
  1. Christine Rüb
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Kurt Mehlhorn.

This work was supported by the DFG, SFB 124, TP B2, VLSI Entwurfsmethoden und Parallelität.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rüb, C. Line-segment intersection reporting in parallel. Algorithmica 8, 119–144 (1992). https://doi.org/10.1007/BF01758839

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation