{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:18:54Z","timestamp":1742977134146,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031220494"},{"type":"electronic","value":"9783031220500"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22050-0_5","type":"book-chapter","created":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T12:14:39Z","timestamp":1670847279000},"page":"60-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Centralised Connectivity-Preserving Transformations by\u00a0Rotation: 3 Musketeers for\u00a0All Orthogonal Convex Shapes"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Connor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6234-3960","authenticated-orcid":false,"given":"Othon","family":"Michail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,13]]},"reference":[{"issue":"5","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1007\/s00453-020-00784-6","volume":"83","author":"HA Akitaya","year":"2021","unstructured":"Akitaya, H.A., et al.: Universal reconfiguration of facet-connected modular robots by pivots: the O(1) musketeers. Algorithmica 83(5), 1316\u20131351 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00784-6","journal-title":"Algorithmica"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2020.04.026","volume":"830\u2013831","author":"A Almethen","year":"2020","unstructured":"Almethen, A., Michail, O., Potapov, I.: Pushing lines helps: efficient universal centralised transformations for programmable matter. Theor. Comput. Sci. 830\u2013831, 43\u201359 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.04.026","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235\u2013253 (2006). https:\/\/doi.org\/10.1007\/s00446-005-0138-3","journal-title":"Distrib. Comput."},{"issue":"24","key":"5_CR4","doi-asserted-by":"publisher","first-page":"5486","DOI":"10.1002\/anie.201100064","volume":"50","author":"X Chen","year":"2011","unstructured":"Chen, X., et al.: Magnetochromatic polydiacetylene by incorporation of Fe3O4 nanoparticles. Angew. Chem. Int. Ed. 50(24), 5486\u20135489 (2011). https:\/\/doi.org\/10.1002\/anie.201100064","journal-title":"Angew. Chem. Int. Ed."},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Connor, M., Michail, O., Potapov, I.: Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach. Theor. Comput. Sci. 936, 77\u201391 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.09.016, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397522005527","DOI":"10.1016\/j.tcs.2022.09.016"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11047-017-9658-6","volume":"17","author":"JJ Daymude","year":"2017","unstructured":"Daymude, J.J., et al.: On the runtime of universal coating for programmable matter. Nat. Comput. 17(1), 81\u201396 (2017). https:\/\/doi.org\/10.1007\/s11047-017-9658-6","journal-title":"Nat. Comput."},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Derakhshandeh, Z., Dolev, S., Gmyr, R., Richa, A.W., Scheideler, C., Strothmann, T.: Amoebot - a new model for programmable matter. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 220\u2013222. SPAA 2014, Association for Computing Machinery, Prague (2014). https:\/\/doi.org\/10.1145\/2612669.2612712","DOI":"10.1145\/2612669.2612712"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Derakhshandeh, Z., Gmyr, R., Richa, A.W., Scheideler, C., Strothmann, T.: An algorithmic framework for shape formation problems in self-organizing particle systems. In: Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, pp. 1\u20132. NANOCOM 2015, Association for Computing Machinery, Boston (2015). https:\/\/doi.org\/10.1145\/2800795.2800829","DOI":"10.1145\/2800795.2800829"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Derakhshandeh, Z., Gmyr, R., Richa, A.W., Scheideler, C., Strothmann, T.: Universal shape formation for programmable matter. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 289\u2013299. SPAA 2016, Association for Computing Machinery, Pacific Grove (2016). https:\/\/doi.org\/10.1145\/2935764.2935784","DOI":"10.1145\/2935764.2935784"},{"issue":"12","key":"5_CR10","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2380656.2380675","volume":"55","author":"D Doty","year":"2012","unstructured":"Doty, D.: Theory of algorithmic self-assembly. Commun. ACM 55(12), 78\u201388 (2012). https:\/\/doi.org\/10.1145\/2380656.2380675","journal-title":"Commun. ACM"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Doty, D.: Timing in chemical reaction networks. In: Proceedings of the 2014 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 772\u2013784. Proceedings, Society for Industrial and Applied Mathematics (2013). https:\/\/doi.org\/10.1137\/1.9781611973402.57","DOI":"10.1137\/1.9781611973402.57"},{"key":"5_CR12","unstructured":"Fekete, S.P., Keldenich, P., Kosfeld, R., Rieck, C., Scheffer, C.: Connected Coordinated Motion Planning with Bounded Stretch. Technical report (2021). http:\/\/arxiv.org\/abs\/2109.12381arXiv:2109.12381"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1089\/cmb.2021.0363","volume":"29","author":"M Feldmann","year":"2022","unstructured":"Feldmann, M., Padalkin, A., Scheideler, C., Dolev, S.: Coordinating amoebots via reconfigurable circuits. J. Comput. Biol.: J. Comput. Mol. Cell Biol. 29(4), 317\u2013343 (2022). https:\/\/doi.org\/10.1089\/cmb.2021.0363","journal-title":"J. Comput. Biol.: J. Comput. Mol. Cell Biol."},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Gilpin, K., Knaian, A., Rus, D.: Robot pebbles: one centimeter modules for programmable matter through self-disassembly. In: 2010 IEEE International Conference on Robotics and Automation, pp. 2485\u20132492 (2010). https:\/\/doi.org\/10.1109\/ROBOT.2010.5509817,iSSN: 1050-4729","DOI":"10.1109\/ROBOT.2010.5509817"},{"key":"5_CR15","unstructured":"Jordan, C.: Cours d\u2019analyse de l\u2019\u00c9cole polytechnique, vol. 1. Gauthier-Villars et fils (1893)"},{"key":"5_CR16","unstructured":"Michail, O., Skretas, G., Spirakis, P.G.: On the Transformation Capability of Feasible Mechanisms for Programmable Matter. Tech. Rep. (2017), http:\/\/arxiv.org\/abs\/1703.04381, arXiv:1703.04381"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.jcss.2018.12.001","volume":"102","author":"O Michail","year":"2019","unstructured":"Michail, O., Skretas, G., Spirakis, P.G.: On the transformation capability of feasible mechanisms for programmable matter. J. Comput. Syst. Sci. 102, 18\u201339 (2019). https:\/\/doi.org\/10.1016\/j.jcss.2018.12.001","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00446-015-0257-4","volume":"29","author":"O Michail","year":"2015","unstructured":"Michail, O., Spirakis, P.G.: Simple and efficient local codes for distributed stable network construction. Distrib. Comput. 29(3), 207\u2013237 (2015). https:\/\/doi.org\/10.1007\/s00446-015-0257-4","journal-title":"Distrib. Comput."},{"issue":"7082","key":"5_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1038\/nature04586","volume":"440","author":"PWK Rothemund","year":"2006","unstructured":"Rothemund, P.W.K.: Folding DNA to create nanoscale shapes and patterns. Nature 440(7082), 297\u2013302 (2006). https:\/\/doi.org\/10.1038\/nature04586","journal-title":"Nature"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 459\u2013468. STOC 2000, Association for Computing Machinery, Portland (2000). https:\/\/doi.org\/10.1145\/335305.335358","DOI":"10.1145\/335305.335358"},{"issue":"6198","key":"5_CR21","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1126\/science.1254295","volume":"345","author":"M Rubenstein","year":"2014","unstructured":"Rubenstein, M., Cornejo, A., Nagpal, R.: Programmable self-assembly in a thousand-robot swarm. Science 345(6198), 795\u2013799 (2014). https:\/\/doi.org\/10.1126\/science.1254295","journal-title":"Science"},{"issue":"4","key":"5_CR22","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s11047-008-9067-y","volume":"7","author":"D Soloveichik","year":"2008","unstructured":"Soloveichik, D., Cook, M., Winfree, E., Bruck, J.: Computation with finite stochastic chemical reaction networks. Nat. Comput. 7(4), 615\u2013633 (2008). https:\/\/doi.org\/10.1007\/s11047-008-9067-y","journal-title":"Nat. Comput."},{"key":"5_CR23","unstructured":"Thalamy, P., Piranda, B., Bourgeois, J.: Distributed self-reconfiguration using a deterministic autonomous scaffolding structure. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pp. 140\u2013148. AAMAS 2019, International Foundation for Autonomous Agents and Multiagent Systems, Montreal QC (2019)"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Thalamy, P., Piranda, B., Bourgeois, J.: 3D coating self-assembly for modular robotic scaffolds. In: 2020 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 11688\u201311695 (Oct 020). https:\/\/doi.org\/10.1109\/IROS45743.2020.9341324, iSSN: 2153-0866","DOI":"10.1109\/IROS45743.2020.9341324"},{"key":"5_CR25","unstructured":"Winfree, E.: Algorithmic Self-assembly of DNA. Ph.D. thesis, California Institute of Technology (1998)"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Woods, D., Chen, H.L., Goodfriend, S., Dabby, N., Winfree, E., Yin, P.: Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, pp. 353\u2013354. ITCS 2013, Association for Computing Machinery, Berkeley (2013). https:\/\/doi.org\/10.1145\/2422436.2422476","DOI":"10.1145\/2422436.2422476"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22050-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T12:15:00Z","timestamp":1670847300000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22050-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031220494","9783031220500"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22050-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOSENSORS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithms and Experiments for Wireless Sensor Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2022.eu\/algosensors\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}