Back to Search
Start Over
Moving coins
- Source :
-
Computational Geometry . Apr2006, Vol. 34 Issue 1, p35-48. 14p. - Publication Year :
- 2006
-
Abstract
- Abstract: 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. [Copyright &y& Elsevier]
- Subjects :
- *COMPUTATIONAL complexity
*MACHINE theory
*COMBINATORICS
*COMBINATORIAL geometry
Subjects
Details
- Language :
- English
- ISSN :
- 09257721
- Volume :
- 34
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Computational Geometry
- Publication Type :
- Academic Journal
- Accession number :
- 19842604
- Full Text :
- https://doi.org/10.1016/j.comgeo.2005.06.005