Research output per year
Research output per year
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic
A rectangular dual of a graph G is a contact representation of G by axis-aligned rectangles such that (i) no four rectangles share a point and (ii) the union of all rectangles is a rectangle. The partial representation extension problem for rectangular duals asks whether a given partial rectangular dual can be extended to a rectangular dual, that is, whether there exists a rectangular dual where some vertices are represented by prescribed rectangles. Combinatorially, a rectangular dual can be described by a regular edge labeling (REL), which determines the orientations of the rectangle contacts. We characterize the RELs that admit an extension, which leads to a linear-time testing algorithm. In the affirmative, we can construct an extension in linear time.
Original language | English |
---|---|
Title of host publication | Algorithms and Complexity |
Subtitle of host publication | 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings |
Editors | Tiziana Calamoneri, Federico Corò |
Publisher | Springer Nature |
Pages | 340-353 |
Number of pages | 14 |
ISBN (Print) | 978-3-030-75241-5 |
DOIs | |
Publication status | Published - 2021 |
Event | 12th International Conference on Algorithms and Complexity - Online, University of Cyprus, Cyprus Duration: 10 May 2021 → 12 May 2021 Conference number: 12 http://easyconferences.eu/ciac2021/ |
Series | Lecture Notes in Computer Science |
---|---|
Volume | 12701 |
ISSN | 0302-9743 |
Conference | 12th International Conference on Algorithms and Complexity |
---|---|
Abbreviated title | CIAC 2021 |
Country/Territory | Cyprus |
Period | 10/05/21 → 12/05/21 |
Internet address |
Research output: Contribution to journal › Article › Academic › peer-review
Research output: Working paper / Preprint › Preprint