Skip to main content
1 of 3
Joseph O'Rourke
  • 150.8k
  • 36
  • 358
  • 958

If you care about speed, then there is a linear-time algorithm specifically tuned to intersecting two convex polygons, described in the book, Computational Geometry in C, with downloadable code.


           Fig.7.15 http://cs.smith.edu/~orourke/MathOverflow/CGinCFig7.15.png
(I took the above snapshot from an illegal scan of the book!)
Joseph O'Rourke
  • 150.8k
  • 36
  • 358
  • 958