Abstract
Let the centers of a finite number of disjoint, closed disks be pinned to the plane, but with each free to rotate about its center. Given an arrangement of such disks with each labeled + or −, we investigate the question of whether they can be all wrapped by a single loop of string so that, when the string is taut and circulates, it rotates by friction all the ⊕-disks counterclockwise and all the ⊝-disks clockwise, without any string-rubbing conflicts. We show that although this is not always possible, natural disk-separation conditions guarantee a solution. We also characterize the hexagonal “penny-packing” arrangements that are wrappable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abellanas, M.: Conectando puntos: poligonizaciones y otros problemas relacionados. Gaceta de la Real Sociedad Matematica Española 11(3), 543–558 (2008)
Demaine, E.D., Demaine, M.L., Palop, B.: Conveyer-belt alphabet. In: Aardse, H., van Baalen, A. (eds.) Findings in Elasticity, pp. 86–89. Pars Foundation, Lars Müller Publishers (April 2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
O’Rourke, J. (2012). String-Wrapped Rotating Disks. In: Márquez, A., Ramos, P., Urrutia, J. (eds) Computational Geometry. EGC 2011. Lecture Notes in Computer Science, vol 7579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34191-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-34191-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34190-8
Online ISBN: 978-3-642-34191-5
eBook Packages: Computer ScienceComputer Science (R0)