Further results on generalized intersection searching problems: Counting, reporting, and dynamization

  • Prosenjit Gupta
  • Ravi Janardan
  • Michiel Smid
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 709)


In a generalized intersection searching problem, a set, S, of colored geometric objects is to be preprocessed so that given some query object, q, the distinct colors of the objects intersected by q can be reported or counted efficiently. In the dynamic setting, colored objects can be inserted into or deleted from S. These problems generalize the well-studied standard intersection searching problems and are rich in applications. Unfortunately, the techniques known for the standard problems do not yield efficient solutions for the generalized problems. Moreover, previous work on generalized problems applies only to the reporting problems and that too mainly to the static case. In this paper, a uniform framework is presented to solve efficiently the counting/reporting/dynamic versions of a variety of generalized intersection searching problems, including: 1-, 2-, and 3-dimensional range searching, quadrant searching, and 2-dimensional point enclosure searching. Several other related results are also mentioned.


Computational geometry data structures dynamization intersection searching persistence 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AvK]
    P.K. Agarwal and M. van Kreveld. Connected component and simple polygon intersection searching. This Proceedings.Google Scholar
  2. [Cha86]
    B.M. Chazelle. Filtering search: a new approach to query-answering. SIAM Journal on Computing, 15:703–724, 1986.CrossRefGoogle Scholar
  3. [CJ90]
    S.W. Cheng and R. Janardan. Efficient dynamic algorithms for some geometric intersection problems. Information Processing Letters, 36:251–258, 1990.CrossRefGoogle Scholar
  4. [DSST89]
    J.R. Driscoll, N. Sarnak, D.D. Sleator, and R.E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38:86–124, 1989.CrossRefGoogle Scholar
  5. [GJS92]
    P. Gupta, R. Janardan, and M. Smid. Further results on generalized intersection searching problems: counting, reporting, and dynamization. Technical Report TR-92-72, Dept. of Computer Science, University of Minnesota, 1992. Submitted.Google Scholar
  6. [JL93]
    R. Janardan and M. Lopez. Generalized intersection searching problems. International Journal of Computational Geometry & Applications, 3:39–69, 1993.Google Scholar
  7. [Lop91]
    M. Lopez. Algorithms for composite geometric objects. PhD thesis, Department of Computer Science, University of Minnesota, Minneapolis, Minnesota, 1991.Google Scholar
  8. [McC85]
    E.M. McCreight. Priority search trees. SIAM Journal on Computing, 14:257–276, 1985.MathSciNetGoogle Scholar
  9. [PS88]
    F.P. Preparata and M.I. Shamos. Computational Geometry — An Introduction. Springer-Verlag, 1988.Google Scholar
  10. [WL85]
    D.E. Willard and G.S. Lueker. Adding range restriction capability to dynamic data structures. Journal of the ACM, 32:597–617, 1985.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Prosenjit Gupta
    • 1
  • Ravi Janardan
    • 1
  • Michiel Smid
    • 2
  1. 1.Department of Computer ScienceUniversity of MinnesotaMinneapolisUSA
  2. 2.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations