Planar point location using persistent search trees
Communications of the ACM
Optimal point location in a monotone subdivision
SIAM Journal on Computing
The input/output complexity of sorting and related problems
Communications of the ACM
Randomized external-memory algorithms for some geometric problems
Proceedings of the fourteenth annual symposium on Computational geometry
Handbook of discrete and computational geometry
Sibling clustering of tree-based spatial indexes for efficient spatial query processing
Proceedings of the seventh international conference on Information and knowledge management
Computational Geometry: Theory and Applications
I/O-efficient dynamic point location in monotone planar subdivisions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the exact worst case query complexity of planar point location
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient dynamic planar point location (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
A new point-location algorithm and its practical efficiency: comparison with existing algorithms
ACM Transactions on Graphics (TOG)
The STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library
The STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library
A Unified Approach for Indexed and Non-Indexed Spatial Joins
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
External-memory computational geometry
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
| Hi-index | 0.00 |
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket method by Edahiro, Kokubo and Asano that is combined with Lee and Yang's batched internal memory algorithm for planar point location. Although our algorithm is not optimal in terms of its worst-case behavior, we show its efficiency for both batched and single-shot queries by experiments with real-world data. The experiments show that the algorithm benefits from its mainly sequential disk access pattern and significantly outperforms the fastest algorithm for internal memory.