On the complexity of a single cell in certain arrangements of surfaces in 3-space (extended abstract)

We obtain near-quadratic upper bounds on the maximum combinatorial complexity of a single cell in certain arrangements of surfaces in 3-space where the lower bound for this quantity is fl(nz) or slightly larger. We prove a theorem that identifies a collection of topological and combinatorial conditions for a set of surface patches in space, which make the complexity of a single cell in an arrangement induced by these surface patches near-quadratic. We apply this result to arrangements relating to motion planning problems of two types of robot systems with three degrees of freedom and also to special arrangements of triangles in space. The complexity of the entire arrangement in each case that we study can be @(n3) in the worst case, and our singlecell bounds are of the form 0(n2a(n)), 0(n2 log n), or 0(n2cr(n) log n). The only previously known similar bounds are for the considerably simpler arrangements of planes or of spheres in space, where the bounds are e(n) and @(rt2) respectively. For some of the arrangements that we study we derive near-quadratic-time algorithms to compute a single cell.

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

[2]  Leonidas J. Guibas,et al.  On the general motion-planning problem with two degrees of freedom , 2015, SCG '88.

[3]  Micha Sharir,et al.  An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space , 1990, Discret. Comput. Geom..

[4]  R. Paul.  Robot manipulators : mathematics, programming, and control : the computer control of robot manipulators , 1981 .

[5]  Franz Aurenhammer,et al.  Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..

[6]  Boris Aronov,et al.  Counting facets and incidences , 1992, Discret. Comput. Geom..

[7]  Micha Sharir,et al.  Efficient Motion Planning for an L-Shaped Object , 1992, SIAM J. Comput..

[8]  Micha Sharir,et al.  Planar realizations of nonlinear davenport-schinzel sequences by segments , 1988, Discret. Comput. Geom..

[9]  Micha Sharir,et al.  Separating two simple polygons by a sequence of translations , 2015, Discret. Comput. Geom..

[10]  Micha Sharir,et al.  An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract) , 1985, SCG '85.

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

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

[13]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[14]  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..

[15]  Leonidas J. Guibas,et al.  The complexity and construction of many faces in arrangements of lines and of segments , 1990, Discret. Comput. Geom..

[16]  Micha Sharir,et al.  An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers , 1987, J. Algorithms.