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.
Original language | English |
---|---|
Title of host publication | LATIN 2014 |
Subtitle of host publication | Theoretical Informatics - 11th Latin American Symposium, Proceedings |
Publisher | Springer Verlag |
Pages | 478-489 |
Number of pages | 12 |
ISBN (Print) | 9783642544224 |
DOIs | |
State | Published - 2014 |
Event | 11th Latin American Theoretical Informatics Symposium, LATIN 2014 - Montevideo, Uruguay Duration: 31 Mar 2014 → 4 Apr 2014 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 8392 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 11th Latin American Theoretical Informatics Symposium, LATIN 2014 |
---|---|
Country/Territory | Uruguay |
City | Montevideo |
Period | 31/03/14 → 4/04/14 |
Bibliographical note
Funding Information:Löffler is partially supported by the NWO (639.021.123). Allen, Mermelstein, Souvaine, and Tóth are supported in part by the NSF (CCF-0830734).
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science