Computing the volume of the union of cubes

MaRDI QIDQ3602886zbMATH OpenFDO

Authors Haim Kaplan, Pankaj K. Agarwal, Micha Sharir

Publication date 12 February 2009

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)

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

Cited in

(9)

• Decomposing the complement of the union of cubes and boxes in three dimensions
• An improved algorithm for Klee's measure problem on fat boxes
• The union of probabilistic boxes: Maintaining the volume
• An improved algorithm for computing the volume of the union of cubes
• Computing Klee's measure of grounded boxes
• Computing feasible toolpaths for 5-axis machines
• A (slightly) faster algorithm for Klee's measure problem
• Approximating the volume of unions and intersections of high-dimensional geometric objects
• 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)