On Translational Motion Planning of a Convex Polyhedron in 3-Space

DOI10.1137/S0097539794266602zbMath0891.68118OpenAlexW2006696440MaRDI QIDQ4376195

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/s0097539794266602

zbMATH Keywords

geometric algorithmscombinatorial geometrycomputational geometrycombinatorial complexityrandomized algorithmsconvex polyhedraalgorithmic motion planning

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

Triangles in space or building (and analyzing) castles in the air, Throwing a sofa through the window, On the union of cylinders in three dimensions, Unnamed Item, Union of Hypercubes and 3D Minkowski Sums with Random Sizes., The number of holes in the union of translates of a convex set in three dimensions, Motion planning via manifold samples, Union of hypercubes and 3D Minkowski sums with random sizes, The union of moving polygonal pseudodiscs -- combinatorial bounds and applications, Decompositions and boundary coverings of non-convex fat polyhedra, On the exact maximum complexity of Minkowski sums of polytopes, Translating a convex polyhedron over monotone polyhedra