Efficient Angle Summation Algorithm for Point Inclusion Test and Its Robustness.
Stepan Yu. Gatilov · 2013
A winding angle summation approach to the point-in-polygon problem is considered. The winding angle summation is backward stable and resis-tant to possible gaps between subsequent edges. A precomputed bounding volume hierarchy can be used to accelerate point queries for winding an-gle summation. The main theorem states that a BVH-accelerated point query takes no longer than O K log n