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
A. Symvonis
中科院分区:
--
文献类型:
--
作者:
P. Kindermann;T. Mchedlidze;R. Prutkin;T. Schneck;A. Symvonis

文献摘要

参考文献

被引文献

相似文献

图形绘制的视觉复杂性可以通过用于表示其元素的几何对象的数量来衡量。在这篇文章中,我们研究了边由较少的线段表示的平面图。在这样的图中,一个线段可以表示形成路径的多个边。在过去的几年里,人们对少段平面图的绘制进行了深入的研究。然而,面积要求只被考虑为有限的平面图的子类。在本文中,我们证明了树有带段和有面积的图,改进了前人的结果。我们还证明了3-连通平面图和双连通外平面图分别有带和段和面积的图。
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.
3 连通平面图的单调绘图
DOI: --
发表时间: 2015
期刊: Embedded Systems and Applications
影响因子: --
作者:
Xin He;Dayu He
通讯作者: Dayu He
DOI: --
发表时间: 2010
期刊: Algorithmica
影响因子: 1.1
作者:
Alfredo García Olaverri;F. Hurtado;M. Noy;J. Tejel
通讯作者: J. Tejel
近乎最佳的树木单调绘制
DOI: --
发表时间: 2016
影响因子: 1.1
作者:
Dayu He;Xin He
通讯作者: Xin He
图表阅读行为:测地线路径趋势
DOI: --
发表时间: 2009
期刊: IEEE Pacific Visualization Symposium
影响因子: --
作者:
Weidong Huang;P. Eades;Seok
通讯作者: Seok
在几个圆和几个球体上绘制图形
DOI: 10.1007/978-3-319-74180-2_14
发表时间: 2017
影响因子: 2.5
作者:
Myroslav Kryven;A. Ravsky;A. Wolff
通讯作者: A. Wolff