Title :
Point-in-polygon tests by determining grid center points in advance
Author :
Jing Li ; Wencheng Wang
Author_Institution :
State Key Lab. of Comput. Sci., Inst. of Software, Beijing, China
fDate :
Oct. 29 2013-Nov. 1 2013
Abstract :
This paper presents a new method for point-inpolygon tests via uniform grids. It consists of two stages, with first to construct a uniform grid and determine the inclusion property of every grid center point, and the second to determine a query point by the center point of its located grid cell. In this way, the simple ray crossing method can be used locally to perform point-in-polygon tests quickly. When O(Ne) grid cells are constructed, as used in many grid-based methods, our new method can considerably reduce the storage requirement and the time on grid construction and determining the grid center points in the first stage, where Ne is the number of polygon edges. As for answering a query point at the second stage, the expected time complexity is O(1) in general. Experiments show that our new method can be several times faster than existing methods at the first stage and an order of magnitude faster at the second stage. Benefited from its high speed and less storage requirement, our new method is very suitable for treating large-scale polygons and dynamic cases, as shown in our experiments.
Keywords :
computational complexity; computational geometry; grid cell; grid center point inclusion property; grid construction; grid-based method; large-scale polygons; point-in-polygon test; polygon edges; query point; ray crossing method; storage requirement; time complexity; uniform grids; Acceleration; Algorithm design and analysis; Equations; Mathematical model; Shape; Time complexity;
Conference_Titel :
Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2013 Asia-Pacific
Conference_Location :
Kaohsiung
DOI :
10.1109/APSIPA.2013.6694387