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

Let B be a convex polyhedron translating in 3-space amidst k convex polyhedral obstacles A1,...,Ak with pairwise disjoint interiors. The free configuration space (space of all collision-free placements) of B can be represented as the complement of the union of the Minkowski sums $P_i=A_i\oplus (-B)$, for i= 1,...,k. We show that the combinatorial complexity of the free configuration space of B is O(nk log k), and that it can be $\Omega(nk\alpha(k))$ in the worst case, where n is the total complexity of the individual Minkowski sums P1,...,Pk. We also derive an efficient randomized algorithm that constructs this configuration space in expected time O(nk log k log n).

[1]  Micha Sharir,et al.  The Common Exterior of Convex Polygons in the Plane , 1997, Comput. Geom..

[2]  James W. Vick,et al.  Homology Theory: An Introduction to Algebraic Topology , 1973 .

[3]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[4]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[5]  Jirí Matousek,et al.  Piecewise linear paths among convex obstacles , 1993, STOC.

[6]  Vladlen Koltun.  Almost tight upper bounds for lower envelopes in higher dimensions , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[7]  Mariette Yvinec,et al.  Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions , 1995, SCG '95.

[8]  Micha Sharir,et al.  The upper envelope of voronoi surfaces and its applications , 1993, Discret. Comput. Geom..

[9]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[10]  Micha Sharir,et al.  Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams , 2016, Discret. Comput. Geom..

[11]  Micha Sharir,et al.  Triangles in space or building (and analyzing) castles in the air , 1990, Comb..

[12]  Raimund Seidel,et al.  Voronoi diagrams and arrangements , 1986, Discret. Comput. Geom..

[13]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..

[14]  Leonidas J. Guibas,et al.  The upper envelope of piecewise linear functions: Algorithms and applications , 2015, Discret. Comput. Geom..

[15]  Micha Sharir,et al.  Efficient algorithms for planning purely translational collision-free motion in two and three dimensions , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[16]  Leonidas J. Guibas,et al.  Computing a face in an arrangement of line segments , 1991, SODA '91.

[17]  Bernard Chazelle.  An optimal algorithm for intersecting three-dimensional convex polyhedra , 1989, 30th Annual Symposium on Foundations of Computer Science.

[18]  Mariette Yvinec,et al.  Applications of random sampling to on-line algorithms in computational geometry , 1992, Discret. Comput. Geom..

[19]  Micha Sharir,et al.  Castles in the air revisited , 1992, SCG '92.

[20]  Micha Sharir,et al.  On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..

[21]  Leonidas J. Guibas,et al.  Computing convolutions by reciprocal search , 1986, SCG '86.

[22]  Micha Sharir,et al.  The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis , 2011, Discret. Comput. Geom..

[23]  Jesse Freeman,et al.  in Morse theory, , 1999 .

[24]  John R. Harper,et al.  Algebraic topology : a first course , 1982 .

[25]  Chee-Keng Yap,et al.  Combinatorial complexity of translating a box in polyhedral 3-space , 1993, SCG '93.