Computational geometry: an introduction
Computational geometry: an introduction
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Computational geometry in C
On the complexity of point-in-polygon algorithms
Computers & Geosciences
A cell-based point-in-polygon algorithm suitable for large sets of points
Computers & Geosciences
Construction of a non-symmetric geometric buffer from a set of line segments
Computers & Geosciences
Containment Test for olygons Containing Circular Arcs
EGUK '02 Proceedings of the 20th UK conference on Eurographics
Efficient computation of volume fractions for multi-material cell complexes in a grid by slicing
Computers & Geosciences
Determining directional distances between points and shorelines using sweep line technique
International Journal of Geographical Information Science
| Hi-index | 0.00 |
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.