A novel point inclusion test for convex polygons based on Voronoi tessellations

被引:3
|
作者
Zengin, Rahman Salim [1 ,3 ]
Sezer, Volkan [2 ,3 ]
机构
[1] Istanbul Tech Univ, Dept Mechatron Engn, Istanbul, Turkey
[2] Istanbul Tech Univ, Dept Control & Automat Engn, Istanbul, Turkey
[3] Istanbul Tech Univ, Elect & Elect Engn Fac, Autonomous Mobil Grp, Istanbul, Turkey
关键词
Point inclusion test; Point in polygon; Convex polygon; Voronoi tessellations;
D O I
10.1016/j.amc.2021.126001
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The point inclusion tests for polygons, in other words the point-in-polygon (PIP) algorithms, are fundamental tools for many scientific fields related to computational geometry, and they have been studied for a long time. The PIP algorithms get direct or indirect geometric definition of a polygonal entity, and validate its containment of a given point. The PIP algorithms, which are working directly on the geometric entities, derive linear boundary definitions for the edges of the polygons. Moreover, almost all direct test methods rely on the two-point form of the line equation to partition the space into half-spaces. Voronoi tessellations use an alternate approach for half-space partitioning. Instead of line equation, distance comparison between generator points is used to accomplish the same task. Voronoi tessellations consist of convex polygons, which are defined between generator points. Therefore, Voronoi tessellations have become an inspiration for us to develop a new approach of the PIP testing, specialized for convex polygons. The equations, essential to the conversion of a convex polygon to a Voronoi polygon, are derived. As a reference, a very standard convex PIP testing algorithm, the sign of offset, is selected for comparison. For generalization of the comparisons, the ray crossing algorithm is used as another reference. All algorithms are implemented as vector and matrix operations without any branching. This enabled us to benefit from the CPU optimizations of the underlying linear algebra libraries. Experimentation showed that, our proposed algorithm can have comparable performance characteristics with the reference algorithms. Moreover, it has simplicity, both from a geometric representation and the mental model. (C) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] A point inclusion test algorithm for simple polygons
    Li, WS
    Ong, ET
    Xu, SH
    Hung, T
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2005, PT 1, 2005, 3480 : 769 - 775
  • [2] Point inclusion test algorithm for simple planar polygons
    Wang, Huabing
    Liu, Weijun
    Bian, Hongyou
    Zhou, Xiongjun
    [J]. Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument, 2007, 28 (SUPPL. 5): : 479 - 482
  • [3] Voronoi Diagram for Intersecting Convex Polygons in the Plane
    Lu, Jiahao
    Xiong, Pengwen
    Min, Weidong
    Liao, Yanqiu
    [J]. Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2019, 31 (09): : 1609 - 1616
  • [4] Compact Voronoi diagrams for moving convex polygons
    Guibas, LJ
    Snoeyink, J
    Zhang, L
    [J]. ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 339 - 352
  • [5] Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
    Gill Barequet
    Minati De
    Michael T. Goodrich
    [J]. Algorithmica, 2021, 83 : 2245 - 2272
  • [6] Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
    Barequet, Gill
    De, Minati
    Goodrich, Michael T.
    [J]. ALGORITHMICA, 2021, 83 (07) : 2245 - 2272
  • [7] Voronoi Tessellations based simple optimizer
    Bajpai, Prathu
    Bansal, Jagdish Chand
    [J]. INFORMATION SCIENCES, 2024, 676
  • [8] Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
    Barequet, Gill
    De, Minati
    Goodrich, Michael T.
    [J]. COMPUTING AND COMBINATORICS (COCOON 2018), 2018, 10976 : 130 - 142
  • [9] Spatial cluster point processes related to Poisson–Voronoi tessellations
    Jesper Møller
    Jakob Gulddahl Rasmussen
    [J]. Stochastic Environmental Research and Risk Assessment, 2015, 29 : 431 - 441
  • [10] Asymptotics for statistical distances based on Voronoi tessellations
    Jiménez, R
    Yukich, JE
    [J]. JOURNAL OF THEORETICAL PROBABILITY, 2002, 15 (02) : 503 - 541