“Recursive construction for
Digital print, 11" x 5", 2008.
Given a pair of start and target configurations, each consisting
of n pairwise disjoint disks in the plane, what is the minimum
number of moves that suffice for transforming the start
into the target configuration? In one move a disk slides in the
without intersecting any other disk, so that its center moves
arbitrary (open) continuous curve. One can easily show that
always suffice, while the above construction shows pairs of
that require 2n-o(n) moves for this task, for every
sufficiently large n.
Disks in the start configuration are white, and disks in the target
configuration are shaded.
Adrian Dumitrescu, Associate Professor of Computer Science, Department of Computer Science,University of Wisconsin-Milwaukee, Milwaukee, USA
"Art could come from anywhere. One just wants to be careful and not