A simple algorithm for Boolean operations on polygons

被引：19

作者：

Martinez, Francisco ^{[1
]}

Ogayar, Carlos ^{[1
]}

Jimenez, Juan R. ^{[1
]}

Rueda, Antonio J. ^{[1
]}

机构：

[1] Univ Jaen, Dept Informat, Jaen 23071, Spain

来源：

ADVANCES IN ENGINEERING SOFTWARE | 2013年 / 64卷

关键词：

Boolean operations polygons; Polygon clipping; Polygon overlay; Computational geometry; Computer graphics; Geometric operations;

D O I：

10.1016/j.advengsoft.2013.04.004

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper a simple and efficient algorithm for computing Boolean operations on polygons is presented. The algorithm works with almost any kind of input polygons: concave polygons, polygons with holes, several contours and self-intersecting edges. Important topological information, as the holes of the result polygon, is computed. (C) 2013 Elsevier Ltd. All rights reserved.

引用

页码：11 / 19

页数：9

共 50 条

[21] Finding shortest safari routes in simple polygons
Tan, XH
Hirata, T
INFORMATION PROCESSING LETTERS, 2003, 87 (04) : 179 - 186
[22] Shortest zookeeper's routes in simple polygons
Tan, XH
INFORMATION PROCESSING LETTERS, 2001, 77 (01) : 23 - 26
[23] An improved algorithm for intersecting convex polygons
Saab, YG
INFORMATION PROCESSING LETTERS, 1997, 61 (02) : 89 - 90
[24] K-vertex guarding simple polygons
Salleh, Ihsan
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2009, 42 (04): : 352 - 361
[25] Optimum sweeps of simple polygons with two guards
Tan, Xuehou
Jiang, Bo
INFORMATION PROCESSING LETTERS, 2014, 114 (03) : 130 - 136
[26] Boolean operations on feature-based models
Gardan, Y
Minich, C
Perrin, E
WSCG'2003, VOL 11, NO 1, CONFERENCE PROCEEDINGS, 2003, : 157 - 164
[27] A universal trapezoidation algorithm for planar polygons
Zalik, B
Clapworthy, GJ
COMPUTERS & GRAPHICS-UK, 1999, 23 (03): : 353 - 363
[28] Computing a single cell in the overlay of two simple polygons
deBerg, M
Devillers, O
Dobrindt, K
Schwarzkopf, O
INFORMATION PROCESSING LETTERS, 1997, 63 (04) : 215 - 219
[29] Fast computation of shortest watchman routes in simple polygons
Tan, XH
INFORMATION PROCESSING LETTERS, 2001, 77 (01) : 27 - 33
[30] Sweeping simple polygons with the minimum number of chain guards
Tan, Xuehou
INFORMATION PROCESSING LETTERS, 2007, 102 (2-3) : 66 - 71

← 1 2 3 4 5 →