Reference : A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex ...
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Computational Sciences
http://hdl.handle.net/10993/28932
A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons
English
Galetzka, Michael mailto [Disy Informationssysteme GmbH]
Glauner, Patrick mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
2017
Proceedings of the 12th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2017), Volume 1: GRAPP
Yes
International
12th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2017)
from 27-02-2017 to 01-03-2017
[en] Complex Polygon ; Even-Odd Algorithm ; Point-in-Polygon.
[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.
http://hdl.handle.net/10993/28932

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons.pdfPublisher postprint755.71 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.