Algorithm to Find the Intersection of Two Convex Polygons

摘要

An algorithm is given that finds the intersection of two convex polygons. It iscoded in Fortran for the IBM PC desktop computer. The program is robust and fast. It has been used successfully in targeting applications that require a rapid determination of the common intersection of more than 100 convex polygons, each specified by more than 150 vertices. Closed, Convex polygons algorithm, INTSEC.