Decomposing the complement of the union of cubes and boxes in three dimensions
From MaRDI portal
Publication:6624162
DOI10.1007/S00454-024-00632-2MaRDI QIDQ6624162FDOQ6624162
Authors: Pankaj K. Agarwal, Micha Sharir 
Publication date: 25 October 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)
Cites Work
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Voronoi diagrams in higher dimensions under certain polyhedral distance functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Planning Algorithms
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
- Triangulating a nonconvex polytope
- Title not available (Why is that?)
- Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
- New Upper Bounds in Klee’s Measure Problem
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Binary Space Partitions for Axis-Aligned Fat Rectangles
- Optimal binary space partitions for orthogonal objects
- Binary Space Partitions for Fat Rectangles
- Efficient binary space partitions for hidden-surface removal and solid modeling
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Union of hypercubes and 3D Minkowski sums with random sizes
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)
