Klee's measure problem on fat boxes in time (n^(d+2)/3)

DOI10.1145/1810959.1810999MaRDI QIDQ5405886zbMATH OpenOpenAlexFDO

Authors Karl Bringmann

Publication date 3 April 2014

Published in Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1810959.1810999

zbMATH Keywords

geometric data structuresunion of cubes

Mathematics Subject Classification ID

Combinatorial complexity of geometric structures (52C45) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An improved algorithm for Klee's measure problem on fat boxes
• A (slightly) faster algorithm for Klee's measure problem
• scientific article; zbMATH DE number 1302378
• Computing Klee's measure of grounded boxes
• An in-place algorithm for Klee's measure problem in two dimensions

Cited in

(10)

• A (slightly) faster algorithm for Klee's measure problem
• Computing Klee's measure of grounded boxes
• Bringing order to special cases of Klee's measure problem
• On Klee's measure problem for grounded boxes
• Computing the volume of the union of cubes
• New Upper Bounds in Klee’s Measure Problem
• An improved algorithm for Klee's measure problem on fat boxes
• scientific article; zbMATH DE number 1302378 (Why is no real title available?)
• Combinatorial designs meet hypercliques: higher lower bounds for Klee's measure problem and related problems in dimensions d 4
• Approximation algorithms for finding maximum containing circle and sphere

This page was built for publication: Klee's measure problem on fat boxes in time \(\partial(n^{(d+2)/3})\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405886)