Graphics gems IV
Spatial databases with application to GIS
Spatial databases with application to GIS
The point in polygon problem for arbitrary polygons
Computational Geometry: Theory and Applications
Realm-based spatial data types: the ROSE algebra
The VLDB Journal — The International Journal on Very Large Data Bases
Plug and Play with Query Algebras: SECONDO-A Generic DBMS Development Environment
IDEAS '00 Proceedings of the 2000 International Symposium on Database Engineering & Applications
Implementation of the ROSE Algebra: Efficient Algorithms for Realm-Based Spatial Data Types
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
GIS: A Computing Perspective, 2nd Edition
GIS: A Computing Perspective, 2nd Edition
User defined topological predicates in database systems
Geoinformatica
| Hi-index | 0.90 |
In this paper, we propose an improved plumb-line algorithm, the Partial-Scan Plumb-Line (PSPL) algorithm, to solve the point-in-region problem. In the PSPL algorithm, every edge of the region (or polygon) is represented as two half segments, and all half segments of the region are sorted according to their dominating points. This is a standard representation for regions in spatial databases, providing efficient support for many plane-sweep algorithms. To support PSPL additionally a "coverage number" is associated with each half segment. In this way, the algorithm can employ a binary search to quickly find the half segment whose dominating point is closest to the given point, and then access only the neighbouring half segments to evaluate the query, leading to dramatic performance improvements, especially for large regions.