Abstract
We consider the problem of performing polygonal map overlay and the refinement step of spatial overlay joins. We show how to adapt algorithms from computational geometry to solve these problems for massive data sets. A performance study with artificial and real-world data sets helps to identify the algorithm that should be used for given input data.
Cite
CITATION STYLE
Becker, L., Giesen, A., Hinrichs, K. H., & Vahrenhold, J. (1999). Algorithms for performing polygonal map overlay and spatial join on massive data sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1651, pp. 270–285). Springer Verlag. https://doi.org/10.1007/3-540-48482-5_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
