Drawings of planar graphs with few slopes and segments
Drawings of planar graphs with few slopes and segments
复制标题
具有少量斜率和线段的平面图
DOI:
10.1016/j.comgeo.2006.09.002
复制
发表时间:
2006
期刊:
影响因子:
--
通讯作者:
D. Wood
中科院分区:
文献类型:
--
作者:
V. Dujmović;D. Eppstein;M. Suderman;D. Wood
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 52n segments and at most 2n slopes. We prove that every cubic 3-connected plane graph has a plane drawing with three slopes (and three bends on the outerface). In a companion paper, drawings of non-planar graphs with few slopes are also considered.