Significant-Presence Range Queries in Categorical Data

  • Mark de Berg
  • Herman J. Haverkort
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2748)


In traditional colored range-searching problems, one wants to store a set of n objects with m distinct colors for the following queries: report all colors such that there is at least one object of that color intersecting the query range. Such an object, however, could be an ‘outlier’ in its color class. Therefore we consider a variant of this problem where one has to report only those colors such that at least a fraction τ of the objects of that color intersects the query range, for some parameter τ. Our main results are on an approximate version of this problem, where we are also allowed to report those colors for which a fraction (1 - ε)τ intersects the query range, for some fixed ε> 0. We present efficient data structures for such queries with orthogonal query ranges in sets of colored points, and for point stabbing queries in sets of colored rectangles.


Computational Geometry Query Range Query Point Query Time Color Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agarwal, P.K.: Range Searching. In: Goodman, J., O’Rourke, J. (eds.) CRC Handbook of Computational Geometry, pp. 575–598. CRC Press, Boca Raton (1997)Google Scholar
  2. 2.
    Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 223, pp. 1–56. American Mathematical Society, Providence (1998)Google Scholar
  3. 3.
    Agarwal, P.K., Govindarajan, S., Muthukrishnan, S.: Range searching in categorical data: colored range searching on a grid. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 17–28. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Alon, N., Füredi, Z., Katchalski, M.: Separating pairs of points by standard boxes. European J. Combinatorics 6, 205–210 (1985)zbMATHGoogle Scholar
  5. 5.
    Dey, T.K.: Improved bounds for planar k-sets and related problems. Discrete and Computational Geometry 19(30), 373–382 (1998)zbMATHMathSciNetGoogle Scholar
  6. 6.
    van Kreveld, M.: New Results on Data Structures in Computational Geometry. PhD thesis, Utrecht University (1992)Google Scholar
  7. 7.
    Nievergelt, J., Widmayer, P.: Spatial data structures: concepts and design choices. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 725–764. Elsevier Science Publishers, Amsterdam (2000)CrossRefGoogle Scholar
  8. 8.
    Gupta, J., Janardan, R., Smid, M.: Further results on generalized intersection searching problems: counting, reporting, and dynamization. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1993. LNCS, vol. 709, pp. 361–373. Springer, Heidelberg (1993)Google Scholar
  9. 9.
    Janardan, R., Lopez, M.: Generalized intersection searching problems. Internat. J. Comput. Geom. Appl. 3, 39–70 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Sharir, M., Smorodinsky, S., Tardos, G.: An Improved Bound for k-Sets in Three Dimensions. Discrete and Computational Geometry 26(2), 195–204 (2001)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Mark de Berg
    • 1
  • Herman J. Haverkort
    • 2
  1. 1.Department of Computer ScienceTU EindhovenEindhovenThe Netherlands
  2. 2.Institute of Information and Computing SciencesUtrecht UniversityUtrechtThe Netherlands

Personalised recommendations