Abstract
We study the configuration space of rectangulations and convex subdivisions of n points in the plane. It is shown that a sequence of O(n log 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 T(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 |
---|---|
Article number | 4 |
Journal | Discrete Mathematics and Theoretical Computer Science |
Volume | 18 |
Issue number | 3 |
State | Published - 2016 |
Bibliographical note
Publisher Copyright:© 2016 by the author(s).
Keywords
- Combinatorial geometry
- Rectangulation
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)
- Discrete Mathematics and Combinatorics