A point inclusion test algorithm for simple polygons

被引：0

作者：

Li, WS ^{[1
]}

Ong, ET ^{[1
]}

Xu, SH ^{[1
]}

Hung, T ^{[1
]}

机构：

[1] Inst High Performance Comp, Singapore 117528, Singapore

来源：

COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2005, PT 1 | 2005年 / 3480卷

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

An algorithm for testing the relationship of a point and a simple polygon is presented. The algorithm employs a "visible edge" of the polygon from the point to determine whether the point is in the polygon or not according to the relationship of the orientation of the polygon and the triangle formed by the point and the visible edge. The algorithm is efficient and robust for floating point computation.

引用

页码：769 / 775

页数：7

共 50 条

[1] 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
[2] A novel point inclusion test for convex polygons based on Voronoi tessellations
Zengin, Rahman Salim
Sezer, Volkan
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2021, 399
[3] ORIENTATION, SIMPLICITY, AND INCLUSION TEST FOR PLANAR POLYGONS
FEITO, F
TORRES, JC
URENA, A
[J]. COMPUTERS & GRAPHICS, 1995, 19 (04) : 595 - 600
[4] Inclusion test for curved-edge polygons
de Miras, JR
Feito, FR
[J]. COMPUTERS & GRAPHICS, 1997, 21 (06) : 815 - 824
[5] A simple algorithm for Boolean operations on polygons
Martinez, Francisco
Ogayar, Carlos
Jimenez, Juan R.
Rueda, Antonio J.
[J]. ADVANCES IN ENGINEERING SOFTWARE, 2013, 64 : 11 - 19
[6] GPU-based parallel algorithm for computing point visibility inside simple polygons
Shoja, Ehsan
Ghodsi, Mohammad
[J]. COMPUTERS & GRAPHICS-UK, 2015, 49 : 1 - 9
[7] An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons
Haitao Wang
[J]. Discrete & Computational Geometry, 2023, 70 : 426 - 454
[8] An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons
Wang, Haitao
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2023, 70 (02) : 426 - 454
[9] 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
[10] A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons
Galetzka, Michael
Glauner, Patrick
[J]. PROCEEDINGS OF THE 12TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER VISION, IMAGING AND COMPUTER GRAPHICS THEORY AND APPLICATIONS (VISIGRAPP 2017), VOL 1, 2017, : 175 - 178

← 1 2 3 4 5 →