Dual perspective method for solving the point in a polygon problem

TL;DR

The paper presents a new, robust method for determining if a point lies inside a polygon, applicable to convex and non-convex shapes, with advantages over existing methods in avoiding rounding errors and computational efficiency.

Contribution

It introduces a novel dual perspective approach for point-in-polygon testing that is independent of rounding errors and suitable for complex polygon shapes.

Findings

Method is applicable to convex and non-convex polygons

It is robust against rounding errors

Compared to existing methods, it offers improved computational efficiency

Abstract

A novel method has been introduced to solve a point inclusion in a polygon problem. The method is applicable to convex as well as non-convex polygons which are not self-intersecting. The introduced method is independent of rounding off errors, which gives it a leverage over some methods prone to this problem. A brief summary of the methods used to solve this problem is presented and the introduced method is discussed. The introduced method is compared to other existing methods from the point of view of computational cost. This method was inspired from a Computational Fluid Dynamics (CFD) application using grids not fitted to the simulated objects.