An O(log n) round algorithm computes a decomposition of arbitrary amoebot structures into O(number of holes) geodesically convex regions using reconfigurable circuits.
Polymers13(14), 2297 (2021)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter
An O(log n) round algorithm computes a decomposition of arbitrary amoebot structures into O(number of holes) geodesically convex regions using reconfigurable circuits.