Point-in-polygon tests for geometric buffers

• Published in: Computers & geosciences Vol. 31; no. 10; pp. 1201 - 1212
• Main Authors: GOMBOSI, Matej, ZALIK, Borut
• Format: Journal Article
• Language: English
• Published: Oxford Elsevier Ltd 01.12.2005; Elsevier Science
• Subjects: Areal geology. Maps; Circular arcs; Computational geometry; Containment test; Earth sciences; Earth, ocean, space; Exact sciences and technology; Geodesic parallel; Geographical information systems; Geologic maps, cartography; Geometric buffer; Internal geophysics; Solid-earth geophysics, tectonophysics, gravimetry; Uniform plane subdivision; Geometric buffer; Computational geometry; Circular arcs; Uniform plane subdivision; Geographical information systems; Containment test; Geodesic parallel; algorithms; maps; polygons; buffers; data processing; geographic information systems; geometry; information systems; geodesy; computers; Containment lest
• ISSN: 0098-3004; 1873-7803
• DOI: 10.1016/j.cageo.2005.03.009

The point-in-polygon problem is often encountered in geographical information systems. The algorithms usually work on polygons defined by straight edges. In some situations, however, polygons containing circular arcs are applied. In geographical information systems these polygons are usually considered as geometric buffers, geodesic offsets, or geodesic parallels. This paper presents three algorithms suitable for providing information about the containment of a point in geometric buffers: the Ray-crossing method, the Cell-Based Algorithm and the Approximate approach. An extensive experimental section allows the reader to select the most efficient algorithm for practical problems.