On geometric shape construction via growth operations
From MaRDI portal
Publication:6111993
DOI10.1007/978-3-031-22050-0_1arXiv2207.03275OpenAlexW4312499312MaRDI QIDQ6111993
Publication date: 4 August 2023
Published in: Algorithmics of Wireless Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.03275
Artificial intelligence for robotics (68T40) Wireless sensor networks as related to computer science (68M18)
Related Items (1)
Cites Work
- Unnamed Item
- Universal coating for programmable matter
- An application of pattern matching to a problem in geometrical complexity
- An improved algorithm to check for polygon similarity
- Terminating distributed construction of shapes and patterns in a fair solution of automata
- On the transformation capability of feasible mechanisms for programmable matter
- The computational power of population protocols
- Shape formation by programmable particles
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- Computation in networks of passively mobile finite-state sensors
- Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
- On the Runtime of Universal Coating for Programmable Matter
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- The program-size complexity of self-assembled squares (extended abstract)
- Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
- Efficient Algorithms for Geometric Graph Search Problems
- Pushing squares around
- Distributed Computation and Reconfiguration in Actively Dynamic Networks
- Simple and efficient local codes for distributed stable network construction
- Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
- The complexity of growing a graph
This page was built for publication: On geometric shape construction via growth operations
