Abstract
We revisit two natural reconfiguration models for systems of disjoint objects in the plane: translation and sliding. Consider a set of n pairwise interior-disjoint objects in the plane that need to be brought from a given start (initial) configuration S into a desired goal (target) configuration T, without causing collisions. In the translation model, in one move an object is translated along a fixed direction to another position in the plane. In the sliding model, one move is sliding an object to another location in the plane by means of an arbitrarily complex continuous motion (that could involve rotations). We obtain several combinatorial and computational results for these two models:
(I) For systems of n congruent disks in the translation model, Abellanas et al.[1] showed that 2n − 1 moves always suffice and \(\lfloor 8n/5 \rfloor\) moves are sometimes necessary for transforming the start configuration into the target configuration. Here we further improve the lower bound to \(\lfloor 5n/3 \rfloor -1\), and thereby give a partial answer to one of their open problems.
(II) We show that the reconfiguration problem with congruent disks in the translation model is NP-hard, in both the labeled and unlabeled variants. This answers another open problem of Abellanas et al.[1].
(III) We also show that the reconfiguration problem with congruent disks in the sliding model is NP-hard, in both the labeled and unlabeled variants.
(IV) For the reconfiguration with translations of n arbitrary convex bodies in the plane, 2n moves are always sufficient and sometimes necessary.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abellanas, M., Bereg, S., Hurtado, F., Olaverri, A.G., Rappaport, D., Tejel, J.: Moving coins. Comput. Geometry: Theory and Applications 34(1), 35–48 (2006)
Bereg, S., Dumitrescu, A.: The lifting model for reconfiguration. Discrete & Computational Geometry 35(4), 653–669 (2006)
Bereg, S., Dumitrescu, A., Pach, J.: Sliding disks in the plane. International Journal of Computational Geometry & Applications 15(8), 373–387 (2008)
de Bruijn, N.G.: Aufgaben 17 and 18 (in Dutch), Nieuw Archief voor Wiskunde 2, 67 (1954)
Călinescu, G., Dumitrescu, A., Pach, J.: Reconfigurations in graphs and grids. SIAM Journal on Discrete Mathematics 22(1), 124–138 (2008)
Chazelle, B., Ottmann, T.A., Soisalon-Soininen, E., Wood, D.: The complexity and decidability of separation. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 119–127. Springer, Heidelberg (1984)
Fejes Tóth, L., Heppes, A.: Über stabile Körpersysteme (in German). Compositio Mathematica 15, 119–126 (1963)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Guibas, L., Yao, F.F.: On translating a set of rectangles. In: Preparata, F. (ed.) Computational Geometry. Advances in Computing Research, vol. 1, pp. 61–67. JAI Press, London (1983)
Hopcroft, J., Schwartz, J., Sharir, M.: On the complexity of motion planning for multiple independent objects; PSPACE- Hardness of the Warehouseman’s Problem. The International Journal of Robotics Research 3(4), 76–88 (1984)
O’Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, Cambridge (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dumitrescu, A., Jiang, M. (2009). On Reconfiguration of Disks in the Plane and Related Problems. In: Dehne, F., Gavrilova, M., Sack, JR., Tóth , C.D. (eds) Algorithms and Data Structures. WADS 2009. Lecture Notes in Computer Science, vol 5664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03367-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-03367-4_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03366-7
Online ISBN: 978-3-642-03367-4
eBook Packages: Computer ScienceComputer Science (R0)