An improved algorithm for computing the volume of the union of cubes

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2010, Pages 230-239

  Agarwal, Pankaj K ^a  

^a Duke University   (United States)

Author keywords

Geometric data structures; Union of cubes

Indexed keywords

BEST-KNOWN ALGORITHMS; GEOMETRIC DATA STRUCTURES; IMPROVED ALGORITHM;

ALGORITHMS; COMPUTATION THEORY; DATA STRUCTURES;

COMPUTATIONAL GEOMETRY;

EID: 77954927288     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810959.1811000     Document Type: Conference Paper

References (16)

1. http://en.wikipedia.org/wiki/Klee'smeasureproblem.
2. P. K. Agarwal, H. Kaplan, and M. Sharir, Computing the volume of the union of cubes, Proc. 23rd Annu. Sympos. Comput. Geom., 2007, 294.301.
3. M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, 2nd edition, Springer Verlag, Heidelberg, 2000.
4. J. L. Bentley, Algorithms for Klee's rectangle problems. Unpublished notes, Computer Science Department, Carnegie Mellon University, 1977.
5. J.D. Boissonnat, M. Sharir, B. Tagansky and M. Yvinec, Voronoi diagrams in higher dimensions under certain polyhedral distance functions, Discrete Comput. Geom. 19 (1998), 485-519. (Pubitemid 128352841)
6. K. Bringmann, Klee's measure problem on fat boxes, Proc. 26th Annu. Sympos. Comput. Geom., 2010, to appear.
7. T. M. Chan, A (slightly) faster algorithm for Klee's measure problem, Comput. Geom.: Theory Appls. 43 (2010), 243-250.
8. E. Chen and T. M. Chan, Space-ef-cient algorithms for Klee's measure problem, Proc. 17th Canadian Conf. Comput. Geom., 2005.
9. B. S. Chlebus, On the Klee's measure problem in small dimensions, Proc. 25th Conf. Current Trends in Theory and Practice of Informatics, 1998, 304-311.
10. M. Dickerson, C. A. Duncan, and M. T. Goodrich, K-d trees are better when cut on the longest side, Proc. 8th European Sympos. Algorithms, 2000, 179190.
11. i], Commun. ACM 21 (1978), 540-544.
12. J. van Leeuwen and D. Wood, The measure problem for rectangular ranges in d-space, J. Algorithms 2 (1981), 282-300.
13. i] be computed in less than O(n log n) steps? Amer. Math. Monthly 84 (1977), 284-285.
14. M. Overmars and J. Leeuwen, Maintenance of configurations in the plane, J. Comput. Syst. Sci. 23 (1981), 166-204.
15. M. Overmars and C.K. Yap, New upper bounds in Klee's measure problem, SIAM J. Comput. 20 (1991), 1034-1045.
16. S. Suzuki and T. Ibaki, An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in d dimensions, Proc. 16th Canadian Conf. Comput. Geom., 2004, 196-199.