Finding Pairwise Intersections of Rectangles in a Query Rectangle

01/23/2018
by   Eunjin Oh, et al.
0

We consider the following problem: Preprocess a set S of n axis-parallel boxes in R^d so that given a query of an axis-parallel box in 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 n) supporting O( 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( n+ k n) query time using O(n n) space. There has been no result known for this problem for higher dimensions, except that for d=3, the best known data structure supports O(√(n)^2n+k^2n) query time using O(n√(n) n) space. For a constant d>2, we present a data structure supporting O(n^1-δ^d-1 n + k polylog n) query time for any constant 1/d≤δ<1. The size of the data structure is O(n^δ d - 2δ + 1 n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2018

Closest-Pair Queries in Fat Rectangles

In the range closest pair problem, we want to construct a data structure...
research
11/02/2022

A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander Graphs

We demonstrate that for expander graphs, for all ϵ > 0, there exists a d...
research
12/20/2022

Dominance for Containment Problems

In a containment problem, the goal is to preprocess a set of geometric o...
research
11/04/2019

Nearly Optimal Static Las Vegas Succinct Dictionary

Given a set S of n (distinct) keys from key space [U], each associated w...
research
07/28/2022

Colorful Helly Theorem for Piercing Boxes with Two Points

Let h(d,2) denote the smallest integer such that any finite collection o...
research
10/18/2021

Data structure for node connectivity queries

Let κ(s,t) denote the maximum number of internally disjoint paths in an ...
research
10/31/2018

A Two Query Adaptive Bitprobe Scheme Storing Five Elements

We are studying the adaptive bitprobe model to store an arbitrary subset...

Please sign up or login with your details

Forgot password? Click here to reset