Paper published in a book (Scientific congresses, symposiums and conference proceedings)
A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons
Galetzka, Michael; Glauner, Patrick
2017 • In Proceedings of the 12th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2017), Volume 1: GRAPP
[en] Determining if a point is in a polygon or not is used by a lot of applications in computer graphics, computer games and geoinformatics. Implementing this check is error-prone since there are many special cases to be considered. This holds true in particular for complex polygons whose edges intersect each other creating holes. In this paper we present a simple even-odd algorithm to solve this problem for complex polygons in linear time and prove its correctness for all possible points and polygons. We furthermore provide examples and implementation notes for this algorithm.
Disciplines :
Computer science
Author, co-author :
Galetzka, Michael; Disy Informationssysteme GmbH
Glauner, Patrick ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
External co-authors :
yes
Language :
English
Title :
A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons
Publication date :
2017
Event name :
12th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2017)
Event date :
from 27-02-2017 to 01-03-2017
Audience :
International
Main work title :
Proceedings of the 12th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2017), Volume 1: GRAPP
Foley, J. D., van Dam, A., Feiner, S. K. and Hughes, J. F. (1990). Computer Graphics: Principles and Practice. The Systems Programming Series. 2nd Edition. Addison-Wesley, Reading.
Hormann, K. and Agathos, A. (2001). The point in polygon problem for arbitrary polygons. Computational Geometry, 20(3):131-144.
Schirra, S. (2008). How reliable are practical pointin-polygon strategies?. Algorithms - ESA 2008, 5193:744-755.
Sedgewick, R. (1992). Algorithms in C++. 1st Edition. Addison-Wesley Professional.
Stueker, D. (1999). Line segment intersection and inclusion in a polygon. Elementary geometric methods.
Tverberg, H. (1980). A proof of the jordan curve theorem. Bulletin of the London Mathematical Society, 12(1):34-38.
Zalik, B. and Kolingerova, I. (2001). A cell-based pointin-polygon algorithm suitable for large sets of points. Computers and Geosciences, 27(10):1135 - 1145.