Extending Partial Representations of Rectangular Duals with Given Contact Orientations

Steven Chaplick; Philipp Kindermann; Jonathan Klawitter; Ignaz Rutter; Alexander Wolff

doi:10.1007/978-3-030-75242-2_24

Extending Partial Representations of Rectangular Duals with Given Contact Orientations

Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

Abstract

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	https://doi.org/10.1007/978-3-030-75242-2_24
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/

Publication series

Series	Lecture Notes in Computer Science
Volume	12701
ISSN	0302-9743

Conference

Conference	12th International Conference on Algorithms and Complexity
Abbreviated title	CIAC 2021
Country/Territory	Cyprus
Period	10/05/21 → 12/05/21
Internet address	http://easyconferences.eu/ciac2021/

Access to Document

10.1007/978-3-030-75242-2_24

1 Article
1 Preprint

Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
Chaplick, S., Felsner, S., Kindermann, P., Klawitter, J., Rutter, I. & Wolff, A., 5 Jun 2022, In: Theoretical Computer Science. 919, p. 66-74 9 p.
Research output: Contribution to journal › Article › Academic › peer-review
Extending Partial Representations of Rectangular Duals with Given Contact Orientations
Chaplick, S., Kindermann, P., Klawitter, J., Rutter, I. & Wolff, A., Feb 2021, 14 p.
Research output: Working paper / Preprint › Preprint

Open Access

Cite this

Chaplick, S., Kindermann, P., Klawitter, J., Rutter, I., & Wolff, A. (2021). Extending Partial Representations of Rectangular Duals with Given Contact Orientations. In T. Calamoneri, & F. Corò (Eds.), Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings (pp. 340-353). Springer Nature. https://doi.org/10.1007/978-3-030-75242-2_24

Chaplick, Steven ; Kindermann, Philipp ; Klawitter, Jonathan et al. / Extending Partial Representations of Rectangular Duals with Given Contact Orientations. Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings. editor / Tiziana Calamoneri ; Federico Corò. Springer Nature, 2021. pp. 340-353 (Lecture Notes in Computer Science, Vol. 12701).

@inbook{d6f47c3e5c7f49848fc712d1791bb5af,

title = "Extending Partial Representations of Rectangular Duals with Given Contact Orientations",

abstract = "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.",

author = "Steven Chaplick and Philipp Kindermann and Jonathan Klawitter and Ignaz Rutter and Alexander Wolff",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.; 12th International Conference on Algorithms and Complexity, CIAC 2021 ; Conference date: 10-05-2021 Through 12-05-2021",

year = "2021",

doi = "10.1007/978-3-030-75242-2_24",

language = "English",

isbn = "978-3-030-75241-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer Nature",

pages = "340--353",

editor = "Tiziana Calamoneri and Federico Cor{\`o}",

booktitle = "Algorithms and Complexity",

address = "Switzerland",

url = "http://easyconferences.eu/ciac2021/",

}

Chaplick, S, Kindermann, P, Klawitter, J, Rutter, I & Wolff, A 2021, Extending Partial Representations of Rectangular Duals with Given Contact Orientations. in T Calamoneri & F Corò (eds), Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings. Springer Nature, Lecture Notes in Computer Science, vol. 12701, pp. 340-353, 12th International Conference on Algorithms and Complexity, Cyprus, 10/05/21. https://doi.org/10.1007/978-3-030-75242-2_24

Extending Partial Representations of Rectangular Duals with Given Contact Orientations. / Chaplick, Steven; Kindermann, Philipp; Klawitter, Jonathan et al.
Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings. ed. / Tiziana Calamoneri; Federico Corò. Springer Nature, 2021. p. 340-353 (Lecture Notes in Computer Science, Vol. 12701).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

TY - CHAP

T1 - Extending Partial Representations of Rectangular Duals with Given Contact Orientations

AU - Chaplick, Steven

AU - Kindermann, Philipp

AU - Klawitter, Jonathan

AU - Rutter, Ignaz

AU - Wolff, Alexander

N1 - Conference code: 12

PY - 2021

Y1 - 2021

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-030-75242-2_24

DO - 10.1007/978-3-030-75242-2_24

M3 - Chapter

SN - 978-3-030-75241-5

T3 - Lecture Notes in Computer Science

SP - 340

EP - 353

BT - Algorithms and Complexity

A2 - Calamoneri, Tiziana

A2 - Corò, Federico

PB - Springer Nature

T2 - 12th International Conference on Algorithms and Complexity

Y2 - 10 May 2021 through 12 May 2021

ER -

Chaplick S, Kindermann P, Klawitter J, Rutter I, Wolff A. Extending Partial Representations of Rectangular Duals with Given Contact Orientations. In Calamoneri T, Corò F, editors, Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings. Springer Nature. 2021. p. 340-353. (Lecture Notes in Computer Science, Vol. 12701). doi: 10.1007/978-3-030-75242-2_24

Extending Partial Representations of Rectangular Duals with Given Contact Orientations

Abstract

Publication series

Conference

Access to Document

Fingerprint

Research output

Simple algorithms for partial and simultaneous rectangular duals with given contact orientations

Extending Partial Representations of Rectangular Duals with Given Contact Orientations

Cite this