Computing the volume of the union of cubes

zbMATH Open1221.68254MaRDI QIDQ3602886FDOQ3602886

Authors: Haim Kaplan, Pankaj K. Agarwal, Micha Sharir 

Publication date: 12 February 2009

Recommendations

• An improved algorithm for computing the volume of the union of cubes
• A (slightly) faster algorithm for Klee's measure problem
• scientific article; zbMATH DE number 6154262
• Klee's measure problem on fat boxes in time \(\partial(n^{(d+2)/3})\)
• The Union of Convex Polyhedra in Three Dimensions

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cited In (8)

• Computing Klee's measure of grounded boxes
• An improved algorithm for computing the volume of the union of cubes
• An improved algorithm for Klee's measure problem on fat boxes
• A (slightly) faster algorithm for Klee's measure problem
• Computing feasible toolpaths for 5-axis machines
• Approximating the volume of unions and intersections of high-dimensional geometric objects
• The union of probabilistic boxes: Maintaining the volume
• Computing the volume is difficult

This page was built for publication: 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 Q3602886)