Finding Pairwise Intersections of Rectangles in a Query Rectangle

Authors Eunjin Oh, Hee-Kap Ahn

Thumbnail PDF


  • Filesize: 0.51 MB
  • 12 pages

Document Identifiers

Author Details

Eunjin Oh
Hee-Kap Ahn

Cite AsGet BibTex

Eunjin Oh and Hee-Kap Ahn. Finding Pairwise Intersections of Rectangles in a Query Rectangle. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 60:1-60:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


We consider the following problem: Preprocess a set S of n axis-parallel boxes in \mathbb{R}^d so that given a query of an axis-parallel box Q in \mathbb{R}^d, the pairs of boxes of S whose intersection intersects the query box can be reported efficiently. For the case that d=2, we present a data structure of size O(n\log n) supporting O(\log n+k) query time, where k is the size of the output. This improves the previously best known result by de Berg et al. which requires O(\log n\log^* n+ k\log n) query time using O(n\log n) space.There has been no known result for this problem for higher dimensions, except that for d=3, the best known data structure supports O(\sqrt{n}+k\log^2\log^* n) query time using O(n\sqrt {n}\log n) space. For a constant d>2, we present a data structure supporting O(n^{1-\delta}\log^{d-1} n + k \polylog n) query time for any constant 1/d\leq\delta<1.The size of the data structure is O(n^{\delta d}\log n) if 1/d\leq\delta<1/2, or O(n^{\delta d-2\delta+1}) if 1/2\leq \delta<1.
  • Geometric data structures
  • axis-parallel rectangles
  • intersection


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Peyman Afshani, Lars Arge, and Kasper Dalgaard Larsen. Orthogonal range reporting in three and higher dimensions. In Proceddings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009), pages 149-158, 2009. Google Scholar
  2. Pankaj K Agarwal, Jeff Erickson, et al. Geometric range searching and its relatives. Contemporary Mathematics, 223:1-56, 1999. Google Scholar
  3. Bernard Chazelle. Filtering search: A new approach to query answering. SIAM Journal on Computing, 15(3):703-724, 1986. Google Scholar
  4. Bernard Chazelle. Lower bounds for orthogonal range searching: I. the reporting case. Journal of the ACM (JACM), 37(2):200-212, 1990. Google Scholar
  5. Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag TELOS, 2008. Google Scholar
  6. Mark de Berg, Joachim Gudmundsson, and Ali D. Mehrabi. Finding pairwise intersections inside a query range. In Proceedings of the 14th Algorithms and Data Structures Symposium (WADS 2015), pages 236-248, 2015. Google Scholar
  7. James R. Driscoll, Neil Sarnak, Daniel D. Sleator, and Robert E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38(1):86-124, 1989. Google Scholar
  8. Prosenjit Gupta. Algorithms for range-aggregate query problems involving geometric aggregation operations. In Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC 2005), pages 892-901, 2005. Google Scholar
  9. Saladi Rahul, Ananda Swarup Das, K. S. Rajan, and Kannan Srinathan. Range-aggregate queries involving geometric aggregation operations. In Proceedings of the 5th International Workshop on Algorithms and Computation (WALCOM 2011), pages 122-133, 2011. Google Scholar
  10. Sairam Subramanian and Sridhar Ramaswamy. The P-range tree: A new data structure for range searching in secondary memory. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1995), pages 378-387, 1995. Google Scholar