On geometric shape construction via growth operations

We study algorithmic growth processes under a geometric setting. Each process begins with an initial shape of nodes S I = S 0 and, in every time step t ≥ 1, by applying (in parallel) one or more growth operations of a specific type to the current shape, S t − 1, generates the next, S t, always satisfying | S t | > | S t − 1 |. We define three types of growth operations and explore the algorithmic and structural properties of their resulting processes. Our goal is to characterize the classes of shapes that can be constructed in O ( log ⁡ n ) or polylog n time steps, n being the size of the final shape S F. Moreover, we want to determine whether a given shape S F can be constructed from a given initial shape S I using a finite sequence of growth operations of a given type, called a constructor of S F. We give exact and partial characterizations of classes of shapes that can be constructed in polylog n time steps, polynomial-time centralized algorithms for deciding reachability between pairs of input shapes ( S I, S F ) and for generating constructors when S F can be constructed from S I, as well as some negative results.

Authors

• Nada Almalki
• Othon Michail

Keywords

• Centralized algorithm
• Geometric growth operation
• Growth process
• Programmable matter
• Constructor