An improved algorithm for Klee's measure problem on fat boxes
From MaRDI portal
Publication:419375
DOI10.1016/J.COMGEO.2011.12.001zbMATH Open1375.52006OpenAlexW2055560312MaRDI QIDQ419375FDOQ419375
Publication date: 18 May 2012
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.12.001
Recommendations
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Spherical and hyperbolic convexity (52A55)
Cites Work
- Voronoi diagrams in higher dimensions under certain polyhedral distance functions
- Title not available (Why is that?)
- A (slightly) faster algorithm for Klee's measure problem
- Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
- Title not available (Why is that?)
- Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?
- Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects
- Computing the volume of the union of cubes
- New Upper Bounds in Klee’s Measure Problem
- On the complexity of computing the measure of ∪[a i ,b i ]
- Semi-Online Maintenance of Geometric Optima and Measures
- An improved algorithm for computing the volume of the union of cubes
Cited In (6)
- An in-place algorithm for Klee's measure problem in two dimensions
- On Klee's measure problem for grounded boxes
- Speeding up many-objective optimization by Monte Carlo approximations
- Computing the depth distribution of a set of boxes
- Efficient transformations for Klee's measure problem in the streaming model
- Faster algorithms for largest empty rectangles and boxes
This page was built for publication: An improved algorithm for Klee's measure problem on fat boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q419375)
