Discrete & Computational Geometry

, Volume 35, Issue 4, pp 653–669

The Lifting Model for Reconfiguration

Authors

    • Department of Computer Science, University of Texas at Dallas, P.O. Box 830688, Richardson, TX 75083
    • Department of Computer Science, University of Wisconsin-Milwaukee, 3200 N. Cramer Street, Milwaukee, WI 53211
Article

DOI: 10.1007/s00454-006-1239-x

Cite this article as:
Bereg, S. & Dumitrescu, A. Discrete Comput Geom (2006) 35: 653. doi:10.1007/s00454-006-1239-x

Abstract

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 is lifted from the plane and placed back in the plane at another location, without intersecting any other disk. We discuss efficient algorithms for this task and estimate their number of moves under different assumptions on disk radii. We then extend our results for arbitrary disks to systems of pseudodisks, in particular to sets of homothetic copies of a convex object.

Reconfiguration

Copyright information

© Springer 2006