SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings
SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings
复制标题
SOFSEM 2023:计算机科学的理论与实践 - 第 48 届计算机科学理论与实践当前趋势国际会议,SOFSEM 2023,斯洛伐克 Nová Smokovec,2023 年 1 月 15-18 日,论文集
DOI:
10.1007/978-3-031-23101-8_8
复制
发表时间:
2023
期刊:
影响因子:
--
通讯作者:
Didimo W
中科院分区:
文献类型:
--
作者:
Didimo W
Orthogonal graph drawings are used in applications such as UML diagrams, VLSI layout, cable plans, and metro maps. We focus on drawing planar graphs and assume that we are given an that describes the desired shape, but not the exact coordinates of a drawing. Our aim is to compute an orthogonal drawing on the grid that has minimum area among all grid drawings that adhere to the given orthogonal representation.This problem is called orthogonal compaction (OC) and is known to be NP-hard, even for orthogonal representations of cycles [Evans et al. 2022]. We investigate the complexity ofOCwith respect to several parameters. Among others, we show thatOCis fixed-parameter tractable with respect to the most natural of these parameters, namely, the number of of the orthogonal representation: the presence of pairs of kitty corners in an orthogonal representation makes theOCproblem hard. Informally speaking, a pair of kitty corners is a pair of reflex corners of a face that point at each other. Accordingly, the number of kitty corners is the number of corners that are involved in some pair of kitty corners.