Trading Time for Space: An O(1) Average Time Algorithm for Point-in-Polygon Location Problem

Algorithms for Point-in-polygon problem solution are very often used especially in computer graphics applications. The naive implementation has O(N) processing time complexity or O(lg N) complexity if a convex polygon is considered. A new algorithm of O(1) processing complexity was developed. The important feature of the algorithm is that preprocessing complexity is O(N) and memory requirements depend on geometrical properties of the given polygon. Usage of the algorithm is expected in applications where many points are tested whether resides in the given polygon or not. The presented approach can be considered as alternative to the parallel processing usage. Experimental results are included, too. Keywords: Point-in-Polygon Algorithm, Data Structures, Algorithm Complexity, Geometry. 1. Introduction Point-in-Polygon algorithms are very often used in many applications, especially within many computer graphics packages. In some applications a number of edges of given convex polygon ca..