A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons

Michael Galetzka, Patrick Glauner

2017

Abstract

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.

Paper Citation

in Harvard Style

Galetzka M. and Glauner P. (2017). A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons . In Proceedings of the 12th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2017) ISBN 978-989-758-224-0, pages 175-178. DOI: 10.5220/0006040801750178

in Bibtex Style

@conference{grapp17,
author={Michael Galetzka and Patrick Glauner},
title={A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons},
booktitle={Proceedings of the 12th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2017)},
year={2017},
pages={175-178},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006040801750178},
isbn={978-989-758-224-0},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 12th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2017)
TI - A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons
SN - 978-989-758-224-0
AU - Galetzka M.
AU - Glauner P.
PY - 2017
SP - 175
EP - 178
DO - 10.5220/0006040801750178