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.
Type de document :
Article dans une revue
Computers and Geosciences, Elsevier, 2010, 〈10.1016/j.cageo.2009.06.008〉
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00517936
Contributeur : Thss Tsinghua <>
Soumis le : jeudi 16 septembre 2010 - 04:49:45
Dernière modification le : vendredi 25 mai 2018 - 12:02:04
Document(s) archivé(s) le : vendredi 2 décembre 2016 - 04:50:42

Fichier

ShengYang2010c.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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 and Geosciences, Elsevier, 2010, 〈10.1016/j.cageo.2009.06.008〉. 〈inria-00517936〉

Partager

Métriques

Consultations de la notice

424

Téléchargements de fichiers

529