Let P and Q be two convex polygons with m and n vertices, respectively, which are specified by their cartesian coordinates in order. A simple O(m+n) algorithm is presented for computing the intersection of P and Q. Unlike previous algorithms, the new algorithm consists of a two-step combination of two simple algorithms for finding convex hulls and triangulations of polygons.
- Computational geometry
- Convex polygons
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
- Computer Graphics and Computer-Aided Design