We study the configuration space of rectangulations and convex subdivisions
of n points in the plane. It is shown that a sequence of O(nlogn)
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.Comment: 17 pages, 12 figures, an extended abstract has been presented at
LATIN 201