© 1984 by British Computer Society
Short Notes
Consistency in Point-in-Polygon Tests

1 School of Computing Studies, University of East Anglia, Norwich, UK, 2 Athens Faculty of Agriculture, Laboratory of Soils and Agricultural Chemistry, Iera Odos, Votanicos, Athens, Greece, 3 Department of Computer Sciences, National Technical University of Athens, 9, Heroon Polytechnion Avenue, Zografou, Athens, Greece.
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.
Received April 1983.
* Part of this work was done while visiting Michigan Technological University.
Present address: Department of Electrical Engineering and Computer Science, Box 104, University of Colorado at Denver, 1100 Fourteenth Street, Denver, Colorado 80202, USA.
¶ School of Computing Studies, University of East Anglia, Norwich NR4 7TJ England
Athens Faculty of Agriculture, Laboratory of Soils and Agricultural Chemistry, Iera Odos, Votanicos, Athens, Greece
++ Department of Computer Sciences, National Technical University of Athens, 9, Heroon Polytechnion Avenue, Zografou, Athens (621), Greece