An improved algorithm for Klee's measure problem on fat boxes

Computational Geometry: Theory and Applications

Volumn 45, Issue 5-6, 2012, Pages 225-233

  Bringmann, Karl ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Geometric data structures; Union of cubes

Indexed keywords

GEOMETRIC DATA STRUCTURES; IMPROVED ALGORITHM; K-CLIQUE; KLEE'S MEASURE PROBLEM; RUNTIMES; TIME ALGORITHMS; UNION OF CUBES;

DATA STRUCTURES;

ALGORITHMS;

EID: 84857050367     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2011.12.001     Document Type: Conference Paper

References (15)

1. P.K. Agarwal, An improved algorithm for computing the volume of the union of cubes, in: Proc. 26th Annual Symposium on Computational Geometry (SoCG'10), 2010, pp. 230-239.
2. P.K. Agarwal, H. Kaplan, M. Sharir, Computing the volume of the union of cubes, in: Proc. 23rd Annual Symposium on Computational Geometry (SoCG'07), 2007, pp. 294-301. (Pubitemid 47582074)
3. J.L. Bentley, Algorithms for Klee's rectangle problems, Department of Computer Science, Carnegie Mellon University, 1977, unpublished notes.
4. J.-D. Boissonnat, M. Sharir, B. Tagansky, M. Yvinec, Voronoi diagrams in higher dimensions under certain polyhedral distance functions, in: Proc. 11th Annual Symposium on Computational Geometry (SoCG'95), 1995, pp. 79-88.
5. K. Bringmann, T. Friedrich, Approximating the volume of unions and intersections of high-dimensional geometric objects, in: Proc. 19th International Symposium on Algorithms and Computation (ISAAC'08), in: LNCS vol. 5369, 2008, pp. 436-447.
6. T.M. Chan Semi-online maintenance of geometric optima and measures SIAM J. Comput. 32 2003 700 716
7. T.M. Chan A (slightly) faster algorithm for Klee's measure problem Computational Geometry: Theory and Applications 43 2010 243 250
8. A. Dumitrescu, J.S.B. Mitchell, and M. Sharir Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles Discrete & Computational Geometry 31 2004 207 227 (Pubitemid 38389604)
9. J. Erickson Klee's measure problem http://compgeom.cs.uiuc.edu/-jeffe/ open/klee.html 1998
10. bi ] Commun. ACM 21 1978 540 544
11. H. Kaplan, N. Rubin, M. Sharir, E. Verbin, Counting colors in boxes, in: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'07), 2007, pp. 785-794.
12. bi ] be computed in less than O (nlog n) steps? American Mathematical Monthly 84 1977 284 285
13. J. Nešetřil, and S. Poljak On the complexity of the subgraph problem Commentationes Mathematicae Universitatis Carolinae 26 1985 415 419
14. M.H. Overmars, and C.-K. Yap New upper bounds in Klee's measure problem SIAM J. Comput. 20 1991 1034 1045
15. S. Suzuki, T. Ibaraki, An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in d dimensions, in: Proc. 16th Canadian Conference on Computational Geometry (CCCG'04), 2004, pp. 196-199.