Skip to main content
Springer Nature Link
Log in

A simple linear algorithm for intersecting convex polygons

  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

LetP andQ be two convex polygons withm andn vertices, respectively, which are specified by their cartesian coordinates in order. A simpleO(m+n) algorithm is presented for computing the intersection ofP andQ. Unlike previous algorithms, the new algorithm consists of a two-step combination of two simple algorithms for finding convex hulls and triangulations of polygons.

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Chazelle B (1980) Computational geometry and convexity. Ph.D. thesis, Carnegie-Mellon University

  2. Chazelle B, Dobkin D (1980) Detection is easier than computation.Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing. pp 146–153

  3. Garey MR, Johnson DS, Preparata FP, Tarjan RE (1978) Triangulating a simple polygon.Information Processing Lett 7:175–179

    Article  MATH  MathSciNet  Google Scholar 

  4. Guibas L, Ramshaw L, Stolfi J (1983) A kinetic framework for computational geometry. Technical report. Xerox Park and Stanford University

  5. Meisters GH (1975) Polygons have ears.American Mathematical Monthly. June/July 1975, 648–651

  6. O'Rourke J (1982) A new linear algorithm for intersecting convex polygons.Comput Graph Image Processing 19:384–391

    Article  MATH  Google Scholar 

  7. Shamos MI (1978) Computational Geometry, Ph.D. thesis, Yale University

  8. Shamos MI (1977)Problems in Computational Geometry. Carnegie-Mellon University

  9. Shamos MI, Hoey D (1976) Geometric intersection problemsProc. Seventeenth Annual IEEE Symposium on Foundations of Computer Science. October 1976, pp 208–215

  10. Toussaint GT (1981) Computational geometric problems in pattern recognition. In: Kittler J (ed)Pattern Recognition Theory and Applications. p 73–91

  11. Toussaint GT (1983) Solving geometric problems with the ‘rotating calipers’.Proc. MELECON, Athens. Greece

  12. Toussaint GT (1984) An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons.Computing 32:357–364

    Article  MATH  MathSciNet  Google Scholar 

  13. Toussaint GT, Avis D (1982) On a convex hull algorithm for polygons and its application to triangulation problems.Pattern Recognition 15:23–29

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University, 805 Sherbrooke Street West, H3A 2K6, Montreal, Quebec, Canada

    Godfried T. Toussaint

Authors
  1. Godfried T. Toussaint
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Toussaint, G.T. A simple linear algorithm for intersecting convex polygons. The Visual Computer 1, 118–123 (1985). https://doi.org/10.1007/BF01898355

Download citation

  • Issue Date:

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

Key words