Abstract
We obtain near-quadratic upper bounds on the maximum combinatorial complexity of a single cell in certain arrangements ofn surfaces in 3-space where the lower bound for this quantity is Ω(n 2) 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 related to motion-planning problems of two types of robot systems with three degrees of freedom and also to a special type of arrangements of triangles in space. The complexity of the entire arrangement in each case that we study can be Θ(n 3) in the worst case, and our single-cell bounds are of the formO(n 2 α(n)), O(n 2logn), orO(n 2 α(n)logn). The only previously known similar bounds are for the considerably simpler arrangements of planes or of spheres in space, where the bounds are Θ(n) and Θ(n 2), respectively. For some of the arrangements that we study we derive near-quadratic-time algorithms to compute a single cell.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
[AA] P. K. Agarwal and B. Aronov, Counting facets and incidences,Discrete and Computational Geometry 7 (1992), 359–369.
[AO] B. Aronov and C. Ó'Dúnlaing, Analysis of the Motion-Planning Problem for a Simple Two-Link Planar Arm, Technical Report 314, Courant Institute of Mathematical Sciences, 1987.
[AS90] B. Aronov and M. Sharir, Triangles in space, or building (and analyzing) castles in the air,Combinatorica 10 (1990), 137–173.
[AS92] B. Aronov and M. Sharir, Castles in the air revisited,Proc. 8th Symposium on Computational Geometry, 1992, pp. 146–156.
[Au] F. Aurenhammer, Power diagrams: Properties, algorithms and applications,SIAM Journal on Computing 16 (1987), 78–96.
[Ca] J. Canny, The Complexity of Robot Motion Planning, Ph.D. Dissertation, Computer Science Department, M.I.T., May 1987.
[CEG+] B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir, and J. Snoeyink, Computing a single face in an arrangement of line segments,Proc. 2nd SIAM-ACM Symposium on Discrete Algorithms, 1991, pp. 441–448.
[CY] J. Cox and C. Yap, On-line motion planning: moving a planar arm by probing an unknown environment, Manuscript, 1989.
[EGP+] H. Edelsbrunner, L. J. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir, Arrangements of curves in the plane: combinatorics, topology and algorithms,Proc. 15th International Colloquium on Automata, Languages and Programming, 1988, pp. 214–229.
[EGS] H. Edelsbrunner, L. J. Guibas and M. Sharir, The complexity and construction of many faces in arrangements of lines and of segments,Discrete and Computational Geometry 5 (1990), 161–196.
[GS] L.J. Guibas and M. Sharir, Combinatorics and algorithms of arrangements, inNew Trends in Discrete and Computational Geometry (J. Pach, ed.), Springer-Verlag, New York, 1993, pp. 9–36.
[GSS] L.J. Guibas, M. Sharir and S. Sifrony, On the general motion planning problem with two degrees of freedom,Discrete and Computational Geometry 4 (1989), 491–521.
[Ha] D. Halperin, Algorithmic Motion Planning via Arrangements of Curves and of Surfaces, Ph.D. Thesis, Tel-Aviv University, July 1992.
[HOS] D. Halperin, M. H. Overmars and M. Sharir, Efficient motion planning for an L-shaped object,SIAM Journal on Computing 21 (1992), 1–23.
[HS] D. Halperin and M. Sharir, Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom,Computational Geometry: Theory and Applications 1 (1992), 269–303.
[HKS] D. P. Huttenlocher, K. Kedem, and M. Sharir, The upper envelope of Voronoi surfaces and its applications,Proc. 7th Symposium on Computational Geometry, 1990, pp. 194–203.
[KLPS] K. Kedem, R. Livne, J. Pach and M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles,Discrete and Computational Geometry 1 (1986), 59–71.
[KS] K. Kedem and M. Sharir, An efficient motion planning algorithm for a convex polygonal object in two-dimensional polygonal space,Discrete and Computational Geometry,5 (1990), 43–75.
[LS] D. Leven and M. Sharir, An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space admidst polygonal barriers,Journal of Algorithms,8 (1987), 192–215.
[PS] J. Pach and M. Sharir, The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: combinatorial analysis,Discrete and Computational Geometry,4 (1989), 291–309.
[Pa] R.P. Paul,Robot Manipulators: Mathematics, Programming and Control, The MIT Press, Cambridge, MA, 1981.
[PSS] R. Pollack, M. Sharir and S. Sifrony, Separating two simple polygons by a sequence of translations,Discrete and Computational Geometry,3 (1988), 123–136.
[Si] S. Sifrony, Efficient Algorithms for Motion Planning Problems in Robotics, Ph.D. Thesis, Tel-Aviv University, January 1989.
[SS] S. Sifrony and M. Sharir, An efficient motion planning algorithm for a rod moving in two-dimensional polygonal space,Algorithmica,2 (1987), 367–402.
[WS] A. Wiernik and M. Sharir, Planar realizations of nonlinear Davenport-Schinzel sequences by segments,Discrete and Computational Geometry,3 (1988), 15–47.
Author information
Authors and Affiliations
Additional information
A preliminary version of this paper has appeared inProc. 7th ACM Symposium on Computational Geometry, North Conway, NH, 1991, pp. 314–323.
Rights and permissions
About this article
Cite this article
Halperin, D. On the complexity of a single cell in certain arrangements of surfaces related to motion planning. Discrete Comput Geom 11, 1–33 (1994). https://doi.org/10.1007/BF02573992
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02573992