TY - JOUR

T1 - Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom

AU - Halperin, Dan

AU - Sharir, Micha

N1 - Funding Information:
We study motion planning problems for several systems with three degrees of freedom. These problems can be rephrased as the problems of analyzing the combinatorial complexity of a single cell in arrangements of certain types of surfaces (actually, surface patches) in 3-dimensional space. The combinatorial complexity of the entire arrangement in each case that we study can be @(n’) in the worst case and for each such arrangement we obtain a subcubic bound on the total combinatorial complexity of all the 3D cells in the arrangement that contain a portion of the 1D boundary of a surface patch in their closure (these are called the interesting cells); the bound is O(n’“) in the case of arrangements related to the motion planning problem of a so-called telescopic arm moving in the plane among polygonal obstacles with n corners, Correspondence to: D. Halperin, School of Mathematical Sciences, The Raymond and Beverly Sackler Faculty of Exact Sciences, Tel-Aviv University, Tel-Aviv, Israel. *Work on this paper has been supported in part by the U.S.-Israeli Binational Science Foundation, the NCRD-the Israeli National Council for Research and Development, and the Foundation for Research in Electronics, Computers and Communications, administered by the Israeli Academy of Sciences and Humanities. Work by the second author has also been supported by Office of Naval Research Grants NOQO14-87-K-0129, NOOO14-89-J-3042 and N00014-90-J-1284, and by National Science Foundation Grant CCR-89-01484.

PY - 1992/5

Y1 - 1992/5

N2 - We study motion planning problems for several systems with three degrees of freedom. These problems can be rephrased as the problems of analyzing the combinatorial complexity of a single cell in arrangements of certain types of surfaces (actually, surface patches) in 3-dimensional space. The combinatorial complexity of the entire arrangement in each case that we study can be Θ(n3) in the worst case and for each such arrangement we obtain a subcubic bound on the total combinatorial complexity of all the 3D cells in the arrangement that contain a portion of the 1D boundary of a surface patch in their closure (these are called the interesting cells); the bound is O(n 7 3) in the case of arrangements related to the motion planning problem of a so-called telescopic arm moving in the plane among polygonal obstacles with n corners, and O(n 5 2) in the case of arrangements resulting from the motion planning problem for an L-shaped object in the plane amidst n point obstacles. We also devise an algorithm to compute the interesting cells in the second type of arrangements, whose time complexity is O(n 5 2log2n), and an algorithm with running time O(n 7 3) for the case of a telescopic arm moving among point obstacles, in both cases improving over the best previously known algorithms for these problems, whose time complexity is O(n3logn). Our approach reduces each three-dimensional problem into a collection of problems involving two-dimensional arrangements. To solve these two-dimensional problems we obtain two combinatorial results of independent interest for arrangements in the plane: (i) a tight bound Θ(nm 1 2) on the maximum joint combinatorial complexity of m 'concave chains' in an arrangement of n pseudo lines, and (ii) an upper bound O(m 2 3n 2 3+nα(n)) on the maximum number of edges of m distinct faces in certain types of arrangements of n pseudo segments, which is within an α(·) factor off the lower bound for this quantity.

AB - We study motion planning problems for several systems with three degrees of freedom. These problems can be rephrased as the problems of analyzing the combinatorial complexity of a single cell in arrangements of certain types of surfaces (actually, surface patches) in 3-dimensional space. The combinatorial complexity of the entire arrangement in each case that we study can be Θ(n3) in the worst case and for each such arrangement we obtain a subcubic bound on the total combinatorial complexity of all the 3D cells in the arrangement that contain a portion of the 1D boundary of a surface patch in their closure (these are called the interesting cells); the bound is O(n 7 3) in the case of arrangements related to the motion planning problem of a so-called telescopic arm moving in the plane among polygonal obstacles with n corners, and O(n 5 2) in the case of arrangements resulting from the motion planning problem for an L-shaped object in the plane amidst n point obstacles. We also devise an algorithm to compute the interesting cells in the second type of arrangements, whose time complexity is O(n 5 2log2n), and an algorithm with running time O(n 7 3) for the case of a telescopic arm moving among point obstacles, in both cases improving over the best previously known algorithms for these problems, whose time complexity is O(n3logn). Our approach reduces each three-dimensional problem into a collection of problems involving two-dimensional arrangements. To solve these two-dimensional problems we obtain two combinatorial results of independent interest for arrangements in the plane: (i) a tight bound Θ(nm 1 2) on the maximum joint combinatorial complexity of m 'concave chains' in an arrangement of n pseudo lines, and (ii) an upper bound O(m 2 3n 2 3+nα(n)) on the maximum number of edges of m distinct faces in certain types of arrangements of n pseudo segments, which is within an α(·) factor off the lower bound for this quantity.

UR - http://www.scopus.com/inward/record.url?scp=38249013357&partnerID=8YFLogxK

U2 - 10.1016/0925-7721(92)90008-G

DO - 10.1016/0925-7721(92)90008-G

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:38249013357

SN - 0925-7721

VL - 1

SP - 269

EP - 303

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

IS - 5

ER -