New Upper Bounds in Klee’s Measure Problem
- 1 December 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 20 (6) , 1034-1045
- https://doi.org/10.1137/0220065
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Batched dynamic solutions to decomposable searching problemsJournal of Algorithms, 1985
- Computational GeometryPublished by Springer Nature ,1985
- Polygon RetrievalSIAM Journal on Computing, 1982
- The measure problem for rectangular ranges in d-spaceJournal of Algorithms, 1981
- 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
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975