Short Notes: Consistency in Point-in-Polygon Tests
F. Warren Burton · The Computer Journal · 1984
In many applications it is necessary to be able to determine if a point is contained in a polygon. If co-ordinate values are approximate, we may be happy to have borderline cases dealt with in an arbitrary manner. However, if two regions have a common border section, decisions should be consistent. A simple algorithm for determining containment consistently is given.