An improved algorithm for intersecting convex polygons

被引：3
作者：
Saab, YG
机构：
来源：
INFORMATION PROCESSING LETTERS | 1997年 / 61卷 / 02期
关键词：
algorithms; computational geometry; convex polygons;
D O I：
10.1016/S0020-0190(96)00195-0
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A modification of a linear-time algorithm to compute the intersection of two convex polygons reduces the number of computational steps by almost half. (C) 1997 Elsevier Science B.V.
引用
收藏
页码：89 / 90
页数：2
相关论文
共 2 条
[1]   A NEW LINEAR ALGORITHM FOR INTERSECTING CONVEX POLYGONS [J].
OROURKE, J ;
CHIEN, CB ;
OLSON, T ;
NADDOR, D .
COMPUTER GRAPHICS AND IMAGE PROCESSING, 1982, 19 (04) :384-391
[2]  
Preparata F., 2012, Computational geometry: an introduction
1