New upper bounds in Klee's measure problem
暂无分享,去创建一个
[1] V. Klee. Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps? , 1977 .
[2] Bruce W. Weide,et al. On the complexity of computing the measure of ∪[ai,bi] , 1978, CACM.
[3] Jan van Leeuwen,et al. The Measure Problem for Rectangular Ranges in d-Space , 1981, J. Algorithms.
[4] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[5] Mark H. Overmars,et al. Batched Dynamic Solutions to Decomposable Searching Problems , 1985, J. Algorithms.
[6] Emo Welzl,et al. Partition trees for triangle counting and other range searching problems , 1988, SCG '88.