Drawing planar graphs with few segments on a polynomial grid
Drawing planar graphs with few segments on a polynomial grid
复制标题
在多项式网格上绘制具有少量线段的平面图
DOI:
10.1007/978-3-030-35802-0_32
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
A. Symvonis
中科院分区:
文献类型:
--
作者:
P. Kindermann;T. Mchedlidze;R. Prutkin;T. Schneck;A. Symvonis
The visual complexity of a graph drawing can be measured by the number of geometric objects used for the representation of its elements. In this paper, we study planar graph drawings where edges are represented by few segments. In such a drawing, one segment may represent multiple edges forming a path. Drawings of planar graphs with few segments were intensively studied in the past years. However, the area requirements were only considered for limited subclasses of planar graphs. In this paper, we show that trees have drawings withsegments andarea, improving the previous result of. We also show that 3-connected planar graphs and biconnected outerplanar graphs have a drawing withandsegments, respectively, andarea.
登录
查看更多内容
DOI:
--
发表时间:
2015
期刊:
Embedded Systems and Applications
影响因子:
--
作者:
Xin He;Dayu He
通讯作者:
Dayu He
影响因子:
1.1
作者:
Alfredo García Olaverri;F. Hurtado;M. Noy;J. Tejel
通讯作者:
J. Tejel
影响因子:
1.1
作者:
Dayu He;Xin He
通讯作者:
Xin He
DOI:
--
发表时间:
2009
期刊:
IEEE Pacific Visualization Symposium
影响因子:
--
作者:
Weidong Huang;P. Eades;Seok
通讯作者:
Seok
影响因子:
2.5
作者:
Myroslav Kryven;A. Ravsky;A. Wolff
通讯作者:
A. Wolff