Abstract
We study sorted geometric query problems, a class of problems that, to the best of our knowledge and despite their applications, have not received much attention so far. Two of the most prominent problems in this class are angular sorting queries and sorted K-nearest neighbour queries. The former asks us to preprocess an input point set S in the plane so that, given a query point q, the clockwise ordering of the points in S around q can be computed efficiently. In the latter problem, the output is the list of K points in S closest to q, sorted by increasing distance from q. The goal in both problems is to construct a small data structure that can answer queries efficiently. We study sorted geometric query problems in the I/O model and prove that, when limited to linear space, the naïve approach of sorting the elements in S in the desired output order from scratch is the best possible. This is highly relevant in an I/O context because storing a massive data set in a superlinear-space data structure is often infeasible. We also prove that answering queries using I/Os requires space, where N is the input size, B is the block size, and M is the size of the main memory. This bound is unlikely to be optimal and in fact we can show that, for a particular class of “persistence-based” data structures, the space lower bound can be improved to Ω(N 2 / M O(1)). Both these lower bounds are a first step towards understanding the complexity of sorted geometric query problems. All our lower bounds assume indivisibility of records and hold as long as B = Ω(log M/B N).
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
Afshani, P., Brodal, G., Zeh, N.: Ordered and unordered top-K range reporting in large data sets. In: Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms, pp. 390–400 (2011)
Afshani, P., Chan, T.M.: Optimal halfspace range reporting in three dimensions. In: Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms, pp. 180–186 (2009)
Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Communications of the ACM 31(9), 1116–1127 (1988)
Arge, L., Danner, A., Teh, S.-M.: I/O-efficient point location using persistent B-trees. In: Proceedings of the 5th Workshop on Algorithm Engineering and Experiments, pp. 82–92 (2003)
Asano, T., Asano, T., Guibas, L., Hershberger, J., Imai, H.: Visibility of disjoint polygons. Algorithmica 1, 49–63 (1986)
Chazelle, B.: Filtering search: a new approach to query answering. SIAM Journal on Computin 15(3), 703–724 (1986)
Gil, J., Steiger, W., Wigderson, A.: Geometric medians. Discrete Mathematics 108(1-3), 37–51 (1992)
Graham, R.: An efficient algorith for determining the convex hull of a finite planar set. Information Processing Letters 1(4), 132–133 (1972)
Kaplan, H.: Persistent data structures. In: Handbook on Data Structures and Applications. CRC Press (2005)
Khuller, S., Mitchell, J.S.B.: On a triangle counting problem. Information Processing Letters 33(6), 319–321 (1990)
Matoušek, J.: Lectures on Discrete Geometry. Springer (2002)
Nouri, M., Ghodsi, M.: Space–Query-Time Tradeoff for Computing the Visibility Polygon. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol. 5598, pp. 120–131. Springer, Heidelberg (2009)
Rousseeuw, P.J., Ruts, I.: Bivariate location depth. Journal of Applied Statistics 45(4), 516–526 (1996)
Suri, S., O’Rourke, J.: Worst-case optimal algorithms for constructing visibility polygons with holes. In: Proceedings of the 2nd ACM Symposium on Computational Geometry, pp. 14–23. ACM (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Afshani, P., Zeh, N. (2012). Lower Bounds for Sorted Geometric Queries in the I/O Model. In: Epstein, L., Ferragina, P. (eds) Algorithms – ESA 2012. ESA 2012. Lecture Notes in Computer Science, vol 7501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33090-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-33090-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33089-6
Online ISBN: 978-3-642-33090-2
eBook Packages: Computer ScienceComputer Science (R0)