{"publication":"Structural Information and Communication Complexity","publisher":"Springer Nature Switzerland","user_id":"55557","_id":"54802","title":"Universal Coating by 3D Hybrid Programmable Matter","citation":{"ama":"Kostitsyna I, Liedtke DJ, Scheideler C. Universal Coating by 3D Hybrid Programmable Matter. In: Emek Y, ed. Structural Information and Communication Complexity. Springer Nature Switzerland; 2024. doi:10.1007/978-3-031-60603-8_21","short":"I. Kostitsyna, D.J. Liedtke, C. Scheideler, in: Y. Emek (Ed.), Structural Information and Communication Complexity, Springer Nature Switzerland, Cham, 2024.","chicago":"Kostitsyna, Irina, David Jan Liedtke, and Christian Scheideler. “Universal Coating by 3D Hybrid Programmable Matter.” In Structural Information and Communication Complexity, edited by Yuval Emek. Cham: Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-60603-8_21.","apa":"Kostitsyna, I., Liedtke, D. J., & Scheideler, C. (2024). Universal Coating by 3D Hybrid Programmable Matter. In Y. Emek (Ed.), Structural Information and Communication Complexity. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-60603-8_21","ieee":"I. Kostitsyna, D. J. Liedtke, and C. Scheideler, “Universal Coating by 3D Hybrid Programmable Matter,” in Structural Information and Communication Complexity, Y. Emek, Ed. Cham: Springer Nature Switzerland, 2024.","mla":"Kostitsyna, Irina, et al. “Universal Coating by 3D Hybrid Programmable Matter.” Structural Information and Communication Complexity, edited by Yuval Emek, Springer Nature Switzerland, 2024, doi:10.1007/978-3-031-60603-8_21.","bibtex":"@inbook{Kostitsyna_Liedtke_Scheideler_2024, place={Cham}, title={Universal Coating by 3D Hybrid Programmable Matter}, DOI={10.1007/978-3-031-60603-8_21}, booktitle={Structural Information and Communication Complexity}, publisher={Springer Nature Switzerland}, author={Kostitsyna, Irina and Liedtke, David Jan and Scheideler, Christian}, editor={Emek, Yuval}, year={2024} }"},"keyword":["Programmable Matter","Coating","Finite Automaton","3D"],"year":"2024","date_created":"2024-06-18T07:36:04Z","date_updated":"2024-07-18T09:32:58Z","editor":[{"full_name":"Emek, Yuval","last_name":"Emek","first_name":"Yuval"}],"publication_identifier":{"isbn":["9783031606021","9783031606038"],"issn":["0302-9743","1611-3349"]},"type":"book_chapter","status":"public","author":[{"full_name":"Kostitsyna, Irina","last_name":"Kostitsyna","first_name":"Irina"},{"full_name":"Liedtke, David Jan","last_name":"Liedtke","first_name":"David Jan","id":"55557"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian","id":"20792"}],"department":[{"_id":"79"}],"doi":"10.1007/978-3-031-60603-8_21","publication_status":"published","place":"Cham","abstract":[{"text":"Motivated by the prospect of nano-robots that assist human physiological functions at the nanoscale, we investigate the coating problem in the three-dimensional model for hybrid programmable matter. In this model, a single agent with strictly limited viewing range and the computational capability of a deterministic finite automaton can act on passive tiles by picking up a tile, moving, and placing it at some spot. The goal of the coating problem is to fill each node of some surface graph of size n with a tile. We first solve the problem on a restricted class of graphs with a single tile type, and then use constantly many tile types to encode this graph in certain surface graphs capturing the surface of 3D objects. Our algorithm requires O(n^2) steps, which is worst-case optimal compared to an agent with global knowledge and no memory restrictions.","lang":"eng"}],"language":[{"iso":"eng"}]}