The number of holes in the union of translates of a convex set in three dimensions
DOI10.1007/S00454-016-9820-4zbMATH Open1361.52005OpenAlexW3105232823MaRDI QIDQ512258FDOQ512258
Authors: Boris Aronov, Michael Gene Dobbins, Xavier Goaoc, Otfried Cheong
Publication date: 24 February 2017
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5902/
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Convex sets in (3) dimensions (including convex surfaces) (52A15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the imbedding of systems of compacta in simplicial complexes
- Union of random Minkowski sums and network vulnerability analysis
- Title not available (Why is that?)
- Improved approximation algorithms for geometric set cover
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Title not available (Why is that?)
- State of the union (of geometric objects)
- On the complexity of the union of fat convex objects in the plane
- On the Boundary Complexity of the Union of Fat Triangles
- Polyhedral Voronoi diagrams of polyhedra in three dimensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Translational Motion Planning of a Convex Polyhedron in 3-Space
Cited In (2)
Uses Software
This page was built for publication: The number of holes in the union of translates of a convex set in three dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512258)