Computing Klee's measure of grounded boxes
From MaRDI portal
Publication:2346960
DOI10.1007/s00453-013-9797-9zbMath1322.68240OpenAlexW1992670853MaRDI QIDQ2346960
Publication date: 26 May 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9797-9
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A (slightly) faster algorithm for Klee's measure problem
- Geometric pattern matching in \(d\)-dimensional space
- 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
- The measure problem for rectangular ranges in d-space
- New Upper Bounds in Klee’s Measure Problem
- Klee's measure problem on fat boxes in time ∂( n ( d +2)/3 )
- An improved algorithm for computing the volume of the union of cubes
This page was built for publication: Computing Klee's measure of grounded boxes