Skip to main content
Springer Nature Link
Log in

A tight upper bound for the number of intersections between two rectangular paths

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The problem of finding the number of intersections between two geometric figures in the plane has been studied extensively in literature. In this paper, the geometric figure comprising a continuous rectilinear path (called rectangular path) is considered, and a tight (least) upper bound onI(P, Q), the number of intersections between two rectangular pathsP andQ, is given.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. J. L. Bentley and T. Ottmann,Algorithms for reporting and counting geometric intersections, IEEE Trans. Comp. 28, 9 (1979), 643–647.

    Google Scholar 

  2. J. L. Bentley and T. Wood,An optimal worst-case algorithm for reporting intersections of rectangles, IEEE Trans. Comp. 29, 7 (1980), 571–577.

    Google Scholar 

  3. K. Q. Brown,Comments on algorithms for reporting and counting geometric intersections, IEEE Trans. Comp. 30, 2 (1981), 147–148.

    Google Scholar 

  4. B. Chazelle,Reporting and counting segment intersections, J. Comp. Syst. Sci. 32, 2 (1986), 156–182.

    Google Scholar 

  5. K. Kant,Finding interferences between rectangular paths, IEEE Trans. Comp. 34, 11 (1985), 1045–1049.

    Google Scholar 

  6. F. P. Preparata and J. Nievergelt,Plane sweep algorithms for intersecting geometric figures, Comm. ACM, 25, 10 (1982), 739–747.

    Article  Google Scholar 

  7. M. I. Shamos and D. Hoey ,Geometric intersection problems, Proc. 17th Ann. IEEE Symp. FOCS, (1976), 208–215.

  8. K. H. Teo and T. C. Tuan,An improved upper bound on the number of intersections between two rectangular paths, Info. Proc. Let., 37, 6 (Mar. 28, 1991), 305–309.

    MathSciNet  Google Scholar 

  9. J. D. Ullman,Computational Aspects of VLSI, Computer Science Press, Rockville, MD, 1984.

    Google Scholar 

  10. Y. L. Wang, R. C. T. Lee and J. S. Chang,The number of intersections between two rectangular paths, IEEE Trans. Comp. 38, 11 (1989), 1564–1571.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems and Computer Science, National University of Singapore, Singapore

    Kim-Heng Teo & Tai-Ching Tuan

  2. School of Electrical Engineering and Computer Science, University of Oklahoma, 73019, Norman, OK, USA

    Kim-Heng Teo & Tai-Ching Tuan

Authors
  1. Kim-Heng Teo
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Tai-Ching Tuan
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Editors' Note: One of our referees has reported that the main result of this paper has recently been given independently by a Chinese researcher at the University of Science and Technology, Hefei, P. R. of China. His paper is under publication in the Chinese Science Bulletin. However, since this journal may not be easily accessible to our readers, and further the two papers are obviously independent of each other, theBIT Editors have decided to accept the present paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Teo, KH., Tuan, TC. A tight upper bound for the number of intersections between two rectangular paths. BIT 31, 598–606 (1991). https://doi.org/10.1007/BF01933175

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

CR Classification

Keywords