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 条
  • [41] Equilateral Monogonal Tessellation of Arbitrary Polygons - a Recursive Algorithm
    Nesenbergs, K.
    MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES, 2019, 13 : 51 - 64
  • [42] Algorithm for computing the union, intersection or difference of two polygons
    Margalit, Avraham, 1600, (13):
  • [43] Query-point visibility constrained shortest paths in simple polygons
    Khosravi, Ramtin
    Ghodsi, Mohammad
    THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 1 - 11
  • [44] Two efficient algorithms for determining intersection points between simple polygons
    Zalik, B
    COMPUTERS & GEOSCIENCES, 2000, 26 (02) : 137 - 151
  • [45] An Efficient Algorithm for Touring a Sequence of given Convex Polygons in the Plane
    Xu, Changan
    Jiang, Bo
    Wang, Lijuan
    PROCEEDINGS OF 2017 6TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2017), 2017, : 74 - 78
  • [46] Adjusted Bare Bones Fireworks Algorithm to Guard Orthogonal Polygons
    Alihodzic, Adis
    Hasanspahic, Damir
    Cunjalo, Fikret
    Smajlovic, Haris
    INTELLIGENT COMPUTING, VOL 2, 2021, 284 : 341 - 356
  • [47] PARALLEL METHODS FOR VISIBILITY AND SHORTEST-PATH PROBLEMS IN SIMPLE POLYGONS
    GOODRICH, MT
    SHAUCK, SB
    GUHA, S
    ALGORITHMICA, 1992, 8 (5-6) : 461 - 486
  • [48] Weak visibility queries of line segments in simple polygons and polygonal domains
    Bygi, M. Nouri
    Ghodsi, M.
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2018, 95 (04) : 721 - 738
  • [49] Algorithm for approximation transitional developable surfaces between two polygons
    Obradovic, Ratko
    Popkonstantinovic, Branislav
    Beljin, Branislav
    TECHNICS TECHNOLOGIES EDUCATION MANAGEMENT-TTEM, 2012, 7 (04): : 1907 - 1913
  • [50] An optimal algorithm for one-separation of a set of isothetic polygons
    Datta, A
    Krithivasan, K
    Ottmann, T
    INFORMATION SCIENCES, 2004, 164 (1-4) : 65 - 88
12345