A simple linear algorithm for intersecting convex polygons |
| |
| Authors: | Godfried T Toussaint |
| |
| Affiliation: | (1) School of Computer Science, McGill University, 805 Sherbrooke Street West, H3A 2K6 Montreal, Quebec, Canada |
| |
| 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. |
| |
| Keywords: | Algorithms Complexity Computational geometry Convex polygons Intersection |
| 本文献已被 SpringerLink 等数据库收录！ |
|
