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(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. © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Ackerman, E., Allen, M. M., Barequet, G., Löffler, M., Mermelstein, J., Souvaine, D. L., & Tóth, C. D. (2014). The flip diameter of rectangulations and convex subdivisions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8392 LNCS, pp. 478–489). Springer Verlag. https://doi.org/10.1007/978-3-642-54423-1_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
