Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
This paper provides a full theoretical and experimental analysis of a serial algorithm for the point-in-polygon test, which requires less running time than previous algorithms and can handle all degenerate cases. The serial algorithm can quickly determine whether a point is inside or outside a polyg...
Main Authors: | Jianqiang Hao, Jianzhi Sun, Yi Chen, Qiang Cai, Li Tan |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-10-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | http://www.mdpi.com/2073-8994/10/10/477 |
Similar Items
Similar Items
-
Any Monotone Function Is Realized by Interlocked Polygons
by: Erik D. Demaine, et al.
Published: (2012-03-01) -
Forms of Crossed and Simple Polygons
by: Luigi Togliani
Published: (2019-12-01) -
Polygonal numbers
by: Chipatala, Overtone
Published: (2016) -
Levels of Sophistication in Elementary Students’ Understanding of Polygon Concept and Polygons Classes
by: Melania Bernabeu, et al.
Published: (2021-08-01) -
Visibility in polygons with applications
by: El-Gindy, Hossam Ahmed.
Published: (1980)