Decomposing the complement of the union of cubes and boxes in three dimensions

DOI10.1007/S00454-024-00632-2MaRDI QIDQ6624162zbMATH OpenFDO

Authors Pankaj K. Agarwal, Micha Sharir

Publication date 25 October 2024

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00454-024-00632-2

zbMATH Keywords

decompositionfat boxesfree spaceunion complexity

Mathematics Subject Classification ID

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

Recommendations

• Computing the volume of the union of cubes
• An improved algorithm for computing the volume of the union of cubes
• On the union of fat tetrahedra in three dimensions
• The union of congruent cubes in three dimensions
• The union of congruent cubes in three dimensions

Cites work

• A singly exponential stratification scheme for real semi-algebraic varieties and its applications
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Binary Space Partitions for Axis-Aligned Fat Rectangles
• Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
• Binary Space Partitions for Fat Rectangles
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Efficient binary space partitions for hidden-surface removal and solid modeling
• scientific article; zbMATH DE number 3497890 (Why is no real title available?)
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• New Upper Bounds in Klee’s Measure Problem
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• Optimal binary space partitions for orthogonal objects
• Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
• Planning Algorithms
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Triangulating a nonconvex polytope
• Union of hypercubes and 3D Minkowski sums with random sizes
• Voronoi diagrams in higher dimensions under certain polyhedral distance functions

This page was built for publication: Decomposing the complement of the union of cubes and boxes in three dimensions

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