Abstract
Let S be a set of geometric objects that are aggregated into disjoint groups. The problem considered is that of preprocessing S so that for any query object, q, the distinct groups such that no objects from those groups are intersected by q can be reported efficiently. The goal is to devise solutions where the query time is sensitive to the output size, i.e., the number of groups reported. Unfortunately, the obvious approaches of (i) solving the corresponding intersection problem for aggregated data and reporting the complement, or (ii) querying with the complement of q are either expensive or incorrect. Efficient, output-sensitive solutions are given to several non-intersection searching problems on aggregated data, using methods such as geometric duality, sparsification, persistence, filtering search, and pruning.
Research of PG supported, in part, by grant SR/S3/EECE/22/2004 from the Dept. of Science and Technology, Govt. of India. Research of RJ supported, in part, by NSF grant INT–0422775. Research of MS supported, in part, by NSERC.
This is a preview of subscription content, log in via an institution to check access.
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., Govindarajan, S., Muthukrishnan, S.: Range Searching in categorical data: colored range searching on grid-trees. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 323–334. Springer, Heidelberg (2002)
Agarwal, P.K., van Kreveld, M.: Connected component and simple polygon intersection searching. Algorithmica 15(6), 626–660 (1996)
Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: New upper bounds for generalized intersection searching problems. In: Fülöp, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 464–475. Springer, Heidelberg (1995)
Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: Red-Blue intersection reporting for objects of non-constant size. The Computer J. 39(6), 541–546 (1996)
Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: New results on intersection query problems. The Computer J. 40(1), 22–29 (1997)
Chazelle, B.: Filtering search: A new approach to query-answering. SIAM J. Computing 15(3), 703–724 (1986)
Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Computer and System Sciences 38, 86–124 (1989)
Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Heidelberg (1987)
Gupta, P., Janardan, R., Smid, M.: Further results on generalized intersection searching problems: counting, reporting, and dynamization. J. Algorithms 19, 282–317 (1995)
Gupta, P., Janardan, R., Smid, M.: Algorithms for generalized halfspace range searching and other intersection searching problems. Computational Geometry: Theory and Applications 5, 321–340 (1996)
Gupta, P., Janardan, R., Smid, M.: A technique for adding range restrictions to generalized searching problems. Information Processing Letters 64, 263–269 (1997)
Gupta, P., Janardan, R., Smid, M.: Algorithms for some intersection searching problems involving circular objects. Intl. J. Math. Algorithms 1, 35–52 (1999)
Gupta, P., Janardan, R., Smid, M.: Computational Geometry: Generalized Intersection Searching. In: Sahni, S., Mehta, D. (eds.) Handbook of Data Structures, ch. 64, pp. 1–17. CRC Press, Boca Raton (2004)
Janardan, R., Lopez, M.: Generalized intersection searching problems. Intl. J. Computational Geometry & Applications 3, 39–69 (1993)
Information culled from the Investment Company Institute’s Mutual Fund Factbook (2003), www.ici.org and Yahoo.com finance.yahoo.com
McCreight, E.M.: Priority search trees. SIAM J. Computing 14(2), 257–276 (1985)
Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proc. 13th Annual Symp. on Discrete Algorithms, pp. 657–666 (2002)
Shi, Q., JaJa, J.: Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines. Technical Report CS–TR–4542, UMIACS Univ. of Maryland, College Park, MD (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, P., Janardan, R., Smid, M. (2005). Efficient Non-intersection Queries on Aggregated Geometric Data. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_55
Download citation
DOI: https://doi.org/10.1007/11533719_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)