A cell-based point-in-polygon algorithm suitable for large sets of points

Computers and Geosciences

Volumn 27, Issue 10, 2001, Pages 1135-1145

  Žalik, Borut ^a   Kolingerova, Ivana ^b  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

Author keywords

Computational geometry; GIS; Point in polygon; Polygon; Uniform subdivision

Indexed keywords

ALGORITHMS; HEURISTIC METHODS;

POLYGONS;

PROBLEM SOLVING;

ALGORITHM; DATA PROCESSING; POLYGON; SOFTWARE;

EID: 0035546470     PISSN: 00983004     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-3004(01)00037-1     Document Type: Article

References (27)

1. Algorithm for computer control of a digital plotter
2. Partitioning very large database tables with Oracle8
3. Efficient and consistent algorithms for determining the containment of points in polygons and polyhedra
4. Analysis of an algorithm for fast ray tracing using uniform space subdivision
5. Delaunay triangulation using a uniform grid
6. Orientation, simplicity, and inclusion test for planar polygons
7. ARTS: Accelerated ray-tracing system
8. On the complexity of point-in-polygon algorithms
9. 2
10. An efficient point-in-polygon algorithm
11. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
12. 2
13. 2 with suboptimal complexity O(1)
14. Point in polygon test
15. A topology construction from line drawings using a uniform plane subdivision technique
16. A universal trapezoidation algorithm for planar polygons
17. An efficient code-based voxel-traversing algorithm