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

DOI10.1145/1810959.1811000MaRDI QIDQ5405887zbMATH OpenOpenAlexFDO

Authors Pankaj K. Agarwal

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.1811000

zbMATH Keywords

geometric data structuresunion of cubes

Mathematics Subject Classification ID

Combinatorial complexity of geometric structures (52C45) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing the volume of the union of cubes
• A (slightly) faster algorithm for Klee's measure problem
• scientific article; zbMATH DE number 1302378
• On the union of fat tetrahedra in three dimensions
• The Union of Convex Polyhedra in Three Dimensions

Cited in

(7)

• Computing the depth distribution of a set of boxes
• Computing Klee's measure of grounded boxes
• Computing the volume of the union of cubes
• An improved algorithm for Klee's measure problem on fat boxes
• Decomposing the complement of the union of cubes and boxes in three dimensions
• An output-sensitive algorithm for computing the union of cubes and fat boxes in 3D
• Approximating Klee's measure problem and a lower bound for union volume estimation

This page was built for publication: An improved algorithm for computing the volume of the union of cubes

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