Moving coins

We consider combinatorial and computational issues that are related to the problem of moving coins from one configuration to another. Coins are defined as non-overlapping discs, and moves are defined as collision free translations, all in the Euclidean plane. We obtain combinatorial bounds on the number of moves that are necessary and/or sufficient to move coins from one configuration to another. We also consider several decision problems related to coin moving, and obtain some results regarding their computational complexity.

• Type: Journal
• Year: 2006
• Where: COMGEO
• Authors: Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel
• Keywords: Applied Computing, Coin, Collision Free Translations, COMGEO 2006, Computational Issues