@inbook{54802,
  abstract     = {{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.}},
  author       = {{Kostitsyna, Irina and Liedtke, David Jan and Scheideler, Christian}},
  booktitle    = {{Structural Information and Communication Complexity}},
  editor       = {{Emek, Yuval}},
  isbn         = {{9783031606021}},
  issn         = {{0302-9743}},
  keywords     = {{Programmable Matter, Coating, Finite Automaton, 3D}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Universal Coating by 3D Hybrid Programmable Matter}}},
  doi          = {{10.1007/978-3-031-60603-8_21}},
  year         = {{2024}},
}