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 条

[41] AN OPTIMAL ALGORITHM FOR THE INTERSECTION RADIUS OF A SET OF CONVEX POLYGONS
JADHAV, S
MUKHOPADHYAY, A
BHATTACHARYA, B
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 652 : 92 - 103
[42] DISSECTIONS OF POLYGONS INTO CONVEX POLYGONS
Zak, Andrzej
[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2010, 20 (02) : 223 - 244
[43] PROBABILITY POLYGONS IN CONVEX POLYGONS
BUCHTA, C
[J]. JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 1984, 347 : 212 - 220
[44] A LINEAR TIME ALGORITHM FOR OBTAINING THE CONVEX-HULL OF A SIMPLE POLYGON
GHOSH, SK
SHYAMASUNDAR, RK
[J]. PATTERN RECOGNITION, 1983, 16 (06) : 587 - 592
[45] Constructing piecewise linear homeomorphisms of simple polygons
Gupta, H
Wenger, R
[J]. JOURNAL OF ALGORITHMS, 1997, 22 (01) : 142 - 157
[46] A simple proof of Pach's Extremal Theorem for convex polygons
Toussaint, Godfried T.
[J]. PATTERN RECOGNITION LETTERS, 1982, 1 (02) : 85 - 86
[47] Mapping Simple Polygons: The Power of Telling Convex from Reflex
Chalopin, Jeremie
Das, Shantanu
Disser, Yann
Mihalak, Matus
Widmayer, Peter
[J]. ACM TRANSACTIONS ON ALGORITHMS, 2015, 11 (04)
[48] Decomposing a simple polygon into pseudo-triangles and convex polygons
Gerdjikov, Stefan
Wolff, Alexander
[J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2008, 41 (1-2): : 21 - 30
[49] An improved kernel for the flip distance problem on simple convex polygons
Bosch-Calvo, Miguel
Kelk, Steven
[J]. INFORMATION PROCESSING LETTERS, 2023, 182
[50] A fast, practical algorithm for the trapezoidation of simple polygons
Hain, TF
Langan, DD
[J]. CISST '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON IMAGING SCIENCE, SYSTEMS, AND TECHNOLOGY: COMPUTER GRAPHICS, 2005, : 98 - 105

← 1 2 3 4 5 →