当前位置: X-MOL 学术Inf. Process. Lett. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
RAC drawings in subcubic area
Information Processing Letters ( IF 0.5 ) Pub Date : 2020-03-24 , DOI: 10.1016/j.ipl.2020.105945
Zahed Rahmati , Fatemeh Emami

In this paper, we study tradeoffs between curve complexity and area of Right Angle Crossing drawings (RAC drawings), which is a challenging theoretical problem in graph drawing. Given a graph with n vertices and m edges, we provide a RAC drawing algorithm with curve complexity 6 and area O(n2.75), which takes time O(n+m). Our algorithm improves the previous upper bound O(n3), by Di Giacomo et al., on the area of RAC drawings.



中文翻译:

次立方区域中的RAC图纸

在本文中,我们研究了曲线复杂度和直角交叉图(RAC图)的面积之间的折衷,这是图形绘制中一个具有挑战性的理论问题。给定一个具有n个顶点和m个边的图形,我们提供了具有曲线复杂度6和面积的RAC绘制算法Øñ2.75,这需要时间 Øñ+。我们的算法提高了先前的上限Øñ3,由Di Giacomo等人撰写,涉及RAC绘图领域。

更新日期:2020-03-24
down
wechat
bug