The Union of Convex Polyhedra in Three Dimensions

DOI10.1137/S0097539793250755zbMath0891.68116OpenAlexW2130642806MaRDI QIDQ4376189

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

zbMATH Keywords

geometric algorithmscombinatorial geometrycomputational geometrycombinatorial complexityrandomized algorithmsconvex polyhedra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Three-dimensional polytopes (52B10) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Linear data structures for fast ray-shooting amidst convex polyhedra, Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications, RED-BLUE SEPARABILITY PROBLEMS IN 3D, The common exterior of convex polygons in the plane, Combinatorial complexity of translating a box in polyhedral 3-space, On the union of cylinders in three dimensions, Union of Hypercubes and 3D Minkowski Sums with Random Sizes., Convexity recognition of the union of polyhedra, Union of hypercubes and 3D Minkowski sums with random sizes, Polyhedral GPU Accelerated Shape from Silhouette