An optimal dynamic interval stabbing-max data structure?
Pankaj Agarwal, Lars Arge, Ke Yi · 2005
1 Introduction In this paper we consider data structures for thestabbing-max problem (also sometimes called the rectangle intersection with priorities problem). That is, theproblem of dynamically maintaining a set S of n axis-parallel hyper-rectangles in Rd, where each rectangle s 2 S has a weight w(s) 2 R, so that the rectangle withthe maximum weight containing a query point can be