Moving rectangles
Document typeConference report
Date issued2010
Rights accessOpen Access
Abstract
Consider a set of n pairwise disjoint axis-parallel rectangles in the plane.
We call this set the source rectangles S. The aim is to move S to a set of (pairwise
disjoint) target rectangles T . A move consists in a horizontal or vertical translation of
one rectangle, such that it does not collide with any other rectangle during the move.
We study how many moves are needed to transform S into T . We obtain bounds
on the number of needed moves for labeled and for unlabeled rectangles, and for
rectangles of different and of equal dimensions.
CitationGarcía, A. [et al.]. Moving rectangles. A: Jornadas de Matemática Discreta y Algorítmica. "VII Jornadas de Matemática Discreta y Algorítmica". Castro Urdiales: 2010, p. 335-346.
ISBN9788469330630
Publisher versionhttp://www.jmda2010.unican.es/actas/Garcia.pdf
Files | Description | Size | Format | View |
---|---|---|---|---|
moving_huemer_10.pdf | 218,1Kb | View/ |
Except where otherwise noted, content on this work is licensed under a Creative Commons license:
Attribution-NonCommercial-NoDerivs 3.0 Spain