A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing

Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf
{"title":"A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing","authors":"Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf","doi":"10.1007/s00454-023-00593-y","DOIUrl":null,"url":null,"abstract":"Abstract Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the existence of an orthogonal representation that allows to describe such drawings purely combinatorially by only listing the angles between the edges around each vertex and the directions of bends on the edges, but neglecting any kind of geometric information such as vertex coordinates or edge lengths. In this work, we generalize this idea to ortho-radial representations of ortho-radial drawings , which are embeddings into an ortho-radial grid, whose gridlines are concentric circles around the origin and straight-line spokes emanating from the origin but excluding the origin itself. Unlike the orthogonal case, there exist ortho-radial representations that do not admit a corresponding drawing, for example so-called strictly monotone cycles. An ortho-radial representation is called valid if it does not contain a strictly monotone cycle. Our first main result is that an ortho-radial representation admits a corresponding drawing if and only if it is valid. Previously such a characterization was only known for ortho-radial drawings of paths, cycles, and theta graphs (Hasheminezhad et al. in Australas J Combin 44:171–182, 2009), and in the special case of rectangular drawings of cubic graphs (Hasheminezhad et al. in Comput Geom 43(9):767–780, 2010), where the contour of each face is required to be a combinatorial rectangle. Additionally, we give a quadratic-time algorithm that tests for a given ortho-radial representation whether it is valid, and we show how to draw a valid ortho-radial representation in the same running time. Altogether, this reduces the problem of computing a minimum-bend ortho-radial drawing to the task of computing a valid ortho-radial representation with the minimum number of bends, and hence establishes an ortho-radial analogue of the topology-shape-metrics framework for planar orthogonal drawings by Tamassia (SIAM J Comput 16(3):421–444, 1987).","PeriodicalId":356162,"journal":{"name":"Discrete and Computational Geometry","volume":"40 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete and Computational Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s00454-023-00593-y","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the existence of an orthogonal representation that allows to describe such drawings purely combinatorially by only listing the angles between the edges around each vertex and the directions of bends on the edges, but neglecting any kind of geometric information such as vertex coordinates or edge lengths. In this work, we generalize this idea to ortho-radial representations of ortho-radial drawings , which are embeddings into an ortho-radial grid, whose gridlines are concentric circles around the origin and straight-line spokes emanating from the origin but excluding the origin itself. Unlike the orthogonal case, there exist ortho-radial representations that do not admit a corresponding drawing, for example so-called strictly monotone cycles. An ortho-radial representation is called valid if it does not contain a strictly monotone cycle. Our first main result is that an ortho-radial representation admits a corresponding drawing if and only if it is valid. Previously such a characterization was only known for ortho-radial drawings of paths, cycles, and theta graphs (Hasheminezhad et al. in Australas J Combin 44:171–182, 2009), and in the special case of rectangular drawings of cubic graphs (Hasheminezhad et al. in Comput Geom 43(9):767–780, 2010), where the contour of each face is required to be a combinatorial rectangle. Additionally, we give a quadratic-time algorithm that tests for a given ortho-radial representation whether it is valid, and we show how to draw a valid ortho-radial representation in the same running time. Altogether, this reduces the problem of computing a minimum-bend ortho-radial drawing to the task of computing a valid ortho-radial representation with the minimum number of bends, and hence establishes an ortho-radial analogue of the topology-shape-metrics framework for planar orthogonal drawings by Tamassia (SIAM J Comput 16(3):421–444, 1987).

Abstract Image

正交径向图绘制的拓扑-形状-度量框架
正交图,即图形嵌入网格,是图形绘制中的一个经典课题。通常,目标是找到一种最小化边缘弯曲数量的绘图。弯曲最小化算法的一个关键要素是正交表示的存在,它允许通过仅列出每个顶点周围的边缘之间的角度和边缘上的弯曲方向来纯粹组合地描述这种绘图,但忽略任何类型的几何信息,如顶点坐标或边缘长度。在这项工作中,我们将这一想法推广到正交径向绘图的正交径向表示,这是嵌入到正交径向网格中的,其网格线是围绕原点的同心圆和从原点发出但不包括原点本身的直线辐条。与正交情况不同,存在不允许相应绘图的正交径向表示,例如所谓的严格单调环。如果一个正交径向表示不包含严格单调环,则称为有效表示。我们的第一个主要结果是,当且仅当一个正交径向表示是有效的,它才允许一个相应的绘图。在此之前,这种特征只在路径、循环和θ图的正交径向图中被发现(Hasheminezhad et al. in Australas J Combin 44:171-182, 2009),以及在三次图的矩形图的特殊情况下(Hasheminezhad et al. in Comput Geom 43(9): 767-780, 2010),其中每个面的轮廓都需要是组合矩形。此外,我们给出了一个二次时间算法,用于测试给定的正交径向表示是否有效,并展示了如何在相同的运行时间内绘制有效的正交径向表示。总之,这将计算最小弯曲正交径向图的问题简化为计算具有最小弯曲数的有效正交径向表示的任务,从而建立了Tamassia (SIAM J Comput 16(3): 421-444, 1987)提出的平面正交图的拓扑-形状-度量框架的正交径向模拟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信