Point-in-polygon tests for geometric buffers
Computers & Geosciences
| Hi-index | 0.00 |
The paper describes an extended algorithm for solvingthe point-in-polygon problem. The polygon in this caseconsists of straight edges and also from circular arcs. Thealgorithm uses the classical ray intersection method. Thedifference is that we now have two types of geometricobjects to test for intersections. Processing is done withsimple and efficient tests, which quickly answer ourquestion. By the use of appropriate data structure, thistask can be done safely and easily. Despite the extensionof the classical ray intersection method, the algorithmstill runs in linear time complexity.