A simple linear algorithm for intersecting convex polygons

被引：36
|
作者：
Toussaint, Godfried T. [1 ]
机构：
[1] McGill Univ, Sch Comp Sci, 805 Sherbrooke St West, Montreal, PQ H3A 2K6, Canada
来源：
VISUAL COMPUTER | 1985年 / 1卷 / 02期
关键词：
Algorithms; Complexity; Computational geometry; Convex polygons; Intersection;
D O I：
10.1007/BF01898355
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：118 / 123
页数：6
相关论文
共 50 条
12345