Abstract
We study the configuration space of rectanulations and convex subdivisions of $n$ points in the plane. It is shown that a sequence of $O(nlog n)$ elementary flip and rotate operations can transform any rectangulation to any other rectangulation on the same set of $n$ points. This bound is the best possible for some point sets, while $n)$ operations are sufficient and necessary for others. Some of our bounds generalize to convex subdivisions of $n$ points in the plane.
Original language | English |
---|---|
Title of host publication | Proc. 11th Latin American Symposium on Theoretical Informatics |
Publication status | Published - 2014 |
Bibliographical note
(to appear)Keywords
- CG, GRAPH