Skip to Main content Skip to Navigation
Journal articles

A point-in-polygon method based on a quasi-closest point

Sheng yang 1 Jun-Hai yong 1 Jiaguang Sun 1 He-Jin Gu 2 Jean-Claude Paul 3 
3 CAD - Computer Aided Design
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : This paper presents a numerically stable solution to a point-in-polygon problem by combining the orientation method and the uniform subdivision technique. We define first a quasi-closest point that can be locally found through the uniform subdivision cells, and then we provide the criteria for determining whether a point lies inside a polygon according to the quasi-closest point. For a large number of points to be tested against the same polygon, the criteria are employed to determine the inclusion property of an empty cell as well as a test point. The experimental tests show that the new method resolves the singularity of a test point on an edge without loss of efficiency. The GIS case study also demonstrates the capability of the method to identify which region contains a test point in a map.
Document type :
Journal articles
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/inria-00517936
Contributor : Thss Tsinghua Connect in order to contact the contributor
Submitted on : Thursday, September 16, 2010 - 4:49:45 AM
Last modification on : Thursday, February 3, 2022 - 11:17:49 AM
Long-term archiving on: : Friday, December 2, 2016 - 4:50:42 AM

File

ShengYang2010c.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Sheng yang, Jun-Hai yong, Jiaguang Sun, He-Jin Gu, Jean-Claude Paul. A point-in-polygon method based on a quasi-closest point. Computers & Geosciences, Elsevier, 2010, 36 (2), pp.205-213. ⟨10.1016/j.cageo.2009.06.008⟩. ⟨inria-00517936⟩

Share

Metrics

Record views

227

Files downloads

893