The measure problem for rectangular ranges in d-space

Quad trees a data structure for retrieval on composite keys

Raphael A. Finkel, Jon Bentley · Acta Informatica · 1974 · 2K citations

Computing, Computer Science, Computer Systems +13

An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles

Bentley · IEEE Transactions on Computers · 1980 · 246 citations

Computing, Computer Engineering, Computer Science +13

Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees

D. T. Lee, C. K. Wong · Acta Informatica · 1977 · 222 citations

Computing, Computer Science, Algorithms +10

On the complexity of computing the measure of ∪[a _i ,b _i ]

Michael L. Fredman, Bruce W. Weide · Communications of the ACM · 1978 · 85 citations · Full text

Computing, Computer Science, Mathematics +17

Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?

Victor Klee · American Mathematical Monthly · 1977 · 57 citations

Computing, Computer Science, Algorithms +5