Abstract
We consider the problem of building a quadtree subdivision for a set \(\mathcal{E}\) of n non-intersecting edges in the plane. Our approach is to first build a quadtree on the vertices corresponding to the endpoints of the edges, and then compute the intersections between \(\mathcal{E}\) and the cells in the subdivision. For any k ≥ 1, we call a K-quadtree a linear compressed quadtree that has O(n/k) cells with O(k) vertices each, where each cell stores the edges intersecting the cell. We show how to build a K-quadtree in O(sort(n + l)) i/o’s, where l = O(n 2/k) is the number of such intersections. The value of k can be chosen to trade off between the number of cells and the size of a cell in the quadtree. We give an empirical evaluation in external memory on triangulated terrains and USA TIGER data. As an application, we consider the problem of map overlay, or finding the pairwise intersections between two sets of edges. Our findings confirm that the K-quadtree is viable for these types of data and its construction is scalable to hundreds of millions of edges.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Arge, L., Danner, A.: From point cloud to grid DEM: a scalable approach. In: Proc. 12th Symp. Spatial Data Handling, SDH 2006, pp. 771–788 (2006)
Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31, 1116–1127 (1988)
Arge, L., Barve, R.D., Hutchinson, D., Procopiuc, O., Toma, L., Vahrenhold, J., Vengroff, D.E., Wickremesinghe, R.: TPIE user manual (2005)
de Berg, M., Haverkort, H., Thite, S., Toma, L.: Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. Computational Geometry 43(5), 493–513 (2010)
Gargantini, I.: An effective way to represent quadtrees. Commun. ACM 25(12), 905–910 (1982)
Hjaltason, G., Samet, H.: Improved bulk-loading algorithms for quadtrees. In: Proc. ACM International Symposium on Advances in GIS, pp. 110–115 (1999)
Hjaltason, G., Samet, H., Sussmann, Y.: Speeding up bulk-loading of quadtrees. In: Proc. ACM International Symposium on Advances in GIS (1997)
Hjaltason, G.R., Samet, H.: Speeding up construction of PMR quadtree-based spatial indexes. VLDB Journal 11, 109–137 (2002)
Hoel, E., Samet, H.: A qualitative comparison study of data structures for large segment databases. In: Proc. SIGMOD, pp. 205–213 (1992)
Nelson, R., Samet, H.: A population analysis for hierarchical data structures. In: Proc. SIGMOD, pp. 270–277 (1987)
Samet, H.: Spatial Data Structures: Quadtrees, Octrees, and Other Hierarchical Methods. Addison-Wesley, Reading (1989)
Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann (2006)
Samet, H., Shaffer, C., Webber, R.: The segment quadtree: a linear quadtree-based representation for linear features. Data Structures for Raster Graphics, 91–123 (1986)
Samet, H., Webber, R.: Storing a collection of polygons using quadtrees. ACM Transactions on Graphics 4(3), 182–222 (1985)
Toma, L.: External Memory Graph Algorithms and Applications to Geographic Information Systems. PhD thesis, Duke University (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haverkort, H., McGranaghan, M., Toma, L. (2013). An Edge Quadtree for External Memory. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds) Experimental Algorithms. SEA 2013. Lecture Notes in Computer Science, vol 7933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38527-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-38527-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38526-1
Online ISBN: 978-3-642-38527-8
eBook Packages: Computer ScienceComputer Science (R0)