The measure problem for rectangular ranges in d-space

This publication has 6 references indexed in Scilit:

• Data structures for the rectangle containment and enclosure problems
  Computer Graphics and Image Processing, 1980
• An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
  IEEE Transactions on Computers, 1980
• On the complexity of computing the measure of ∪[a _i ,b _i ]
  Communications of the ACM, 1978
• Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?
  The American Mathematical Monthly, 1977
• Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
  Acta Informatica, 1977
• Quad trees a data structure for retrieval on composite keys
  Acta Informatica, 1974