Answers are grounded in this paper and cite their sources.
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 configuration into the target configuration? In one move a disk slides in the plane without intersecting any other disk, so that its center moves along an arbitrary (open) continuous curve. We discuss efficient algorithms for this task and estimate their number of moves under different assumptions on disk radii. For example, with n congruent disks, [Formula: see text] moves always suffice for transforming the start configuration into the target configuration; on the other hand, [Formula: see text] moves are sometimes necessary.
No takes yet. Share an insight, caveat, or question.
Bereg et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: