New upper bounds in Klee's measure problem
SIAM Journal on Computing
On the complexity of computing the measure of ∪[ai,bi]
Communications of the ACM
On the Klee`s Measure Problem in Small Dimensions
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Computing the volume of the union of cubes
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
A (slightly) faster algorithm for Klee's measure problem
Computational Geometry: Theory and Applications
Klee's measure problem on fat boxes in time ∂(n(d+2)/3)
Proceedings of the twenty-sixth annual symposium on Computational geometry
Klee's measure problem on fat boxes in time ∂(n(d+2)/3)
Proceedings of the twenty-sixth annual symposium on Computational geometry
The union of probabilistic boxes: maintaining the volume
ESA'11 Proceedings of the 19th European conference on Algorithms
An improved algorithm for Klee's measure problem on fat boxes
Computational Geometry: Theory and Applications
On Klee's measure problem for grounded boxes
Proceedings of the twenty-eighth annual symposium on Computational geometry
| Hi-index | 0.00 |
Let C be a set of n axis-aligned cubes in ℜ3, and let U(C) denote the union of C. We present an algorithm that computes the volume of U(C) in time O(n polylog(n)). The previously best known algorithm takes O(n4/3 log2 n) time.