Advertisement

Sliding Disks in the Plane

  • Sergey Bereg
  • Adrian Dumitrescu
  • János Pach
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3742)

Abstract

Given a pair of start and target configurations, each consisting of n pairwise disjoint disks in the plane, what is the minimum number of moves that suffice for transforming the start configuration into the target configuration? In one move a disk slides in the plane without intersecting any other disk, so that its center moves along an arbitrary (open) continuous curve. We discuss efficient algorithms for this task and estimate their number of moves under different assumptions on disk radii and disk placements. For example, with n congruent disks, \(\frac{3n}{2}+O(\sqrt{n {\rm log}n})\) moves always suffice for transforming the start configuration into the target configuration; on the other hand, \((1+\frac{1}{15}){\it n} - O(\sqrt{n})\) moves are sometimes necessary.

Keywords

Target Position Small Disk Large Disk Convex Object Black Disk 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abellanas, M., Hurtado, F., Olaverri, A.G., Rappaport, D., Tejel, J.: Moving coins. Short version, In: Abstracts of Japan Conference on Discrete and Computational Geometry; Full version submitted to LNCS Proceedings (2004)Google Scholar
  2. 2.
    Alon, N., Katchalski, M., Pulleyblank, W.R.: Cutting disjoint disks by straight lines. Discrete & Computational Geometry 4, 239–243 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Böröczky, K.: Über stabile Kreis- und Kugelsysteme (in German). Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 7, 79–82 (1964)zbMATHGoogle Scholar
  4. 4.
    Brass, P., Moser, W.O.J., Pach, J.: Research Problems in Discrete Geometry. Springer, Heidelberg (2005) (to appear)zbMATHGoogle Scholar
  5. 5.
    de Bruijn, N.G.: Aufgaben 17 and 18 (in Dutch). Nieuw Archief voor Wiskunde 2, 67 (1954)Google Scholar
  6. 6.
    Demaine, E., Demaine, M., Verrill, H.: Coin-moving puzzles. In: Nowakowski, R.J. (ed.) More Games of No Chance, pp. 405–431. Cambridge University Press, Cambridge (2002)Google Scholar
  7. 7.
    Dumitrescu, A., Pach, J.: Pushing squares around. In: Proceedings of the 20-th Annual Symposium on Computational Geometry (SOCG 2004), NY, June 2004, pp. 166–123 (2004)Google Scholar
  8. 8.
    Fejes Tóth, L., Heppes, A.: Über stabile Körpersysteme (in German). Compositio Mathematica 15, 119–126 (1963)MathSciNetGoogle Scholar
  9. 9.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Sergey Bereg
    • 1
  • Adrian Dumitrescu
    • 2
  • János Pach
    • 3
  1. 1.Computer ScienceUniversity of Texas at DallasRichardsonUSA
  2. 2.Computer ScienceUniversity of Wisconsin–MilwaukeeMilwaukeeUSA
  3. 3.Courant Institute of Mathematical SciencesNew YorkUSA

Personalised recommendations