Short Notes: Consistency in Point-in-Polygon Tests
Open Access
- 1 January 1984
- journal article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 27 (4) , 375-376
- https://doi.org/10.1093/comjnl/27.4.375
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: