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) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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

(11)

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

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)