The Union of Convex Polyhedra in Three Dimensions
DOI10.1137/S0097539793250755zbMATH Open0891.68116OpenAlexW2130642806MaRDI QIDQ4376189FDOQ4376189
Authors: B. Tagansky, Boris Aronov, Micha Sharir 
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539793250755
Recommendations
- Convexity recognition of the union of polyhedra
- On the union of fat tetrahedra in three dimensions
- Unions of fat convex polytopes have short skeletons
- Almost tight bound for a single cell in an arrangement of convex polyhedra in \(\mathbb{R}^3\)
- A single cell in an arrangement of convex polyhedra in \(\mathbb R^3\)
computational geometryrandomized algorithmscombinatorial geometryconvex polyhedracombinatorial complexitygeometric algorithms
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Three-dimensional polytopes (52B10) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cited In (29)
- On the union of fat tetrahedra in three dimensions
- Convexity recognition of the union of polyhedra
- Polyhedral GPU Accelerated Shape from Silhouette
- The union of congruent cubes in three dimensions
- An improved algorithm for computing the volume of the union of cubes
- On the convex hull of the union of certain polyhedra
- Combinatorial complexity of translating a box in polyhedral 3-space
- A single cell in an arrangement of convex polyhedra in \(\mathbb R^3\)
- Union of hypercubes and 3D Minkowski sums with random sizes
- Union of hypercubes and 3D Minkowski sums with random sizes
- Output-sensitive construction of the union of triangles
- On regular vertices of the union of planar convex objects
- Unions of fat convex polytopes have short skeletons
- Title not available (Why is that?)
- On the union of cylinders in three dimensions
- Title not available (Why is that?)
- Computing the volume of the union of cubes
- The union of congruent cubes in three dimensions
- Linear data structures for fast ray-shooting amidst convex polyhedra
- Local polyhedra and geometric graphs
- Line transversals of convex polyhedra in \(\mathbb{R}^3\)
- RED-BLUE SEPARABILITY PROBLEMS IN 3D
- Decompositions and boundary coverings of non-convex fat polyhedra
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
- Local polyhedra and geometric graphs
- Integral Polyhedra in Three Space
- The common exterior of convex polygons in the plane
- Almost tight bound for a single cell in an arrangement of convex polyhedra in \(\mathbb{R}^3\)
- The number of holes in the union of translates of a convex set in three dimensions
This page was built for publication: The Union of Convex Polyhedra in Three Dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376189)
