Abstract
We consider the problem of separating a set of polygons by a sequence of translations (one such collision-free translation motion for each polygon). If all translations are performed in a common direction the separability problem so obtained has been referred to as the uni-directional separability problem; for different translation directions, the more general multi-directional separability problem arises. The class of such separability problems has been studied previously and arises e.g. in computer graphics and robotics. Existing solutions to the uni-directional problem typically assume the objects to have a certain predetermined shape (e.g., rectangular or convex objects), or to have a direction of separation already available. Here we show how to compute all directions of unidirectional separability for sets of arbitrary simple polygons.
The problem of determining whether a set of polygons is multi-directionally separable had been posed by G.T. Toussaint. Here we present an algorithm for solving this problem which, in addition to detecting whether or not the given set is multidirectionally separable, also provides an ordering in which to separate the polygons. In case that the entire set is not multi-directionally separable, the algorithm will find the largest separable subset.
Similar content being viewed by others
References
Chazelle B, Ottmann T, Soisalon-Soinen E, Wood D (1983) The complexity and decidability of SeparationTM. Tech Rep CS-83-34, Data Structuring Group, University of Waterloo (November 1983)
Guibas, LJ, Yao FF (1980) On translating a set of rectangles. Proc. 12th Ann ACM Symp Theory of Computing, pp 154–160
Mansouri M, Toussaint GT (1985) Translation queries for convex polygons. Proc IASTED Int Symp Robotics and Automation ′85, Lugano, Switzerland (June 1985)
Mehlhorn K, (1984) Data structures and algorithms 3: multidimensional searching and computational geometry, Springer, Tokyo Berlin Heidelberg New York, p 212
Nurmi O (1984) On translating a set of objects in 2 and 3 dimensional spaces. Bericht 141, Institut für angewandte Informatik und formale Beschreibungssysteme, Universität Karlsruhe, Federal Republic of Germany
Ottmann T, Widmayer P (1983) On translating a set of line segments. Computer Vision, Graphics and Image Processing 24, pp 382–389
Sack, J-R, Toussaint GT (1983) Movability of objects, IEEE Int Symp Inf Theory, St. Jovite, Canada (September 1983)
Sack J-R, Toussaint GT (1985) Translating polygons in the plane. Proc. STACS ′85, Saarbrücken, Federal Republic of Germany (January 1985), pp 310–321 (also to appear in Robotica 1987)
Sharir M, Cole R, Kedem K, Leven D, Pollack R, Sifrony S (1986) Geometric applications of Davenport-Schinzel Sequences. Proc 27th Symp Found Comput Sci (Toronto 1986), pp 77–86
Shamos MI, Hoey D (1976) Geometric intersection problems. Proc 7th Ann IEEE Symp Found comput Sci, pp 208–215
Spirakis P, Yap CK (1983a) Strong NP-hardness of moving many discs. Tech Rep No 92, Courant Institute, NYU (September 1983)
Spirakis P, Yap CK (1983b) On the combinatorial complexity of motion coordination. Tech Rep No 76, Courant Institute, NYU (April 1983)
Toussaint GT (1984) On translating a set of spheres. Tech Rep SOCS-8.4, School of Computer Science, McGill University, Montréal (March 1984)
Toussaint GT (1985) Movable separability of sets. In: Toussaint GT (ed) Computational Geometry. North Holland, pp 335–376
Toussaint GT (1986) Shortest path solves translation separability of polygons. Tech Rep SCS-8.27, School of Computer Science, McGill University, Montréal (October 1985)
Toussaint GT, Sack J-R (1983) Some new results on moving polygons in the plane. Proc Robotic Intelligence and Productivity Conference, Detroit, MI (November 1983), pp 158–163
Toussaint GT, ElGindy H (1984) Separation of two monotone polygons in linear time. Robotica 2: 215–220
Whitesides S (1985) Computational geometry and spatial planning. In: Toussaint GT (ed) Computational Geometry. North Holland, pp 377–428
Yap CK (1983) Motion planning for two discs. Tech Rep Courant Institute, NYU
Yap CK (1984) Coordinating the motion of several discs. Tech Rept No 105, Courant Institute, NYU (February 1984)
Author information
Authors and Affiliations
Additional information
Research supported by NSERC under grant No. A9173 and A0392, respectively
Rights and permissions
About this article
Cite this article
Dehne, F., Sack, JR. Translation separability of sets of polygons. The Visual Computer 3, 227–235 (1987). https://doi.org/10.1007/BF01952829
Issue Date:
DOI: https://doi.org/10.1007/BF01952829