{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T19:18:23Z","timestamp":1723231103176},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2008,10]]},"abstract":"<jats:p> 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. For example, with n congruent disks, [Formula: see text] moves always suffice for transforming the start configuration into the target configuration; on the other hand, [Formula: see text] moves are sometimes necessary. <\/jats:p>","DOI":"10.1142\/s0218195908002684","type":"journal-article","created":{"date-parts":[[2008,10,15]],"date-time":"2008-10-15T11:22:41Z","timestamp":1224069761000},"page":"373-387","source":"Crossref","is-referenced-by-count":14,"title":["SLIDING DISKS IN THE PLANE"],"prefix":"10.1142","volume":"18","author":[{"given":"SERGEY","family":"BEREG","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Texas at Dallas, Box 830688, Richardson, TX 75083, USA"}]},{"given":"ADRIAN","family":"DUMITRESCU","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Wisconsin\u2013Milwaukee, Milwaukee, WI 53201-0784, USA"}]},{"given":"J\u00c1NOS","family":"PACH","sequence":"additional","affiliation":[{"name":"Courant Institute of Mathematical Sciences, 251 Mercer Street, New York, NY 10012-1185, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.06.005"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187724"},{"key":"rf4","first-page":"79","volume":"7","author":"B\u00f6r\u00f6czky K.","journal-title":"Ann. Univ. Sci. Budapest. E\u00f6tv\u00f6s Sect. Math."},{"key":"rf5","volume-title":"Research Problems in Discrete Geometry","author":"Bra\u03b2 P.","year":"2005"},{"key":"rf7","unstructured":"E.\u00a0Demaine, M.\u00a0Demaine and H.\u00a0Verrill, More Games of No Chance, ed. R. J.\u00a0Nowakowski (Cambridge University Press, 2002)\u00a0pp. 405\u2013431."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-005-0640-1"},{"key":"rf9","first-page":"119","volume":"15","author":"T\u00f3th L. Fejes","journal-title":"Compositio Mathematica"},{"key":"rf10","unstructured":"L.\u00a0Guibas and F. F.\u00a0Yao, Computational Geometry, Advances in Computing Research\u00a01, ed. F.\u00a0Preparata (JAI Press, London, 1983)\u00a0pp. 61\u201367."}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195908002684","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:22:58Z","timestamp":1565137378000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195908002684"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":8,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,10]]}},"alternative-id":["10.1142\/S0218195908002684"],"URL":"https:\/\/doi.org\/10.1142\/s0218195908002684","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10]]}}}