Strictly-Convex Drawings of 3-Connected Planar Graphs

被引：1

作者：

Bekos, Michael A. ^{[1
]}

Gronemann, Martin ^{[2
]}

Montecchiani, Fabrizio ^{[3
]}

Symvonis, Antonios ^{[4
]}

机构：

[1] Univ Ioannina, Dept Math, Ioannina, Greece

[2] TU Wien, Algorithms & Complex Grp, Vienna, Austria

[3] Univ Perugia, Dept Engn, Perugia, Italy

[4] NTUA, Sch Appl Math & Phys Sci, Athens, Greece

来源：

GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2022 | 2023年 / 13764卷

关键词：

Strictly-convex drawings; Area bounds; Planar graphs; GRID DRAWINGS;

D O I：

10.1007/978-3-031-22203-0_11

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Strictly-convex straight-line drawings of 3-connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such drawings is O(n(2))xO(n(2)), as shown by Barany and Rote by means of a sophisticated technique based on perturbing (non-strictly) convex drawings. Unfortunately, the hidden constants in such area bound are in the 10(4) order. We present a new and easy-to-implement technique that yields strictly-convex straight-line planar drawings of 3-connected planar graphs on an integer grid of size 2(n - 1) x (5n(3) - 4n(2)).

引用

页码：144 / 156

页数：13

共 50 条

[1] Convex grid drawings of 3-connected planar graphs
Chrobak, M
Kant, G
[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1997, 7 (03) : 211 - 223
[2] Convex Drawings of 3-Connected Plane Graphs
Nicolas Bonichon
Stefan Felsner
Mohamed Mosbah
[J]. Algorithmica, 2007, 47 : 399 - 420
[3] Convex drawings of 3-connected plane graphs
Bonichon, Nicolas
Felsner, Stefan
Mosbah, Mohamed
[J]. ALGORITHMICA, 2007, 47 (04) : 399 - 420
[4] On Planar Greedy Drawings of 3-Connected Planar Graphs
Giordano Da Lozzo
Anthony D’Angelo
Fabrizio Frati
[J]. Discrete & Computational Geometry, 2020, 63 : 114 - 157
[5] On Planar Greedy Drawings of 3-Connected Planar Graphs
Da Lozzo, Giordano
D'Angelo, Anthony
Frati, Fabrizio
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2020, 63 (01) : 114 - 157
[6] On convex embeddings of planar 3-connected graphs
Kelmans, A
[J]. JOURNAL OF GRAPH THEORY, 2000, 33 (02) : 120 - 124
[7] Strictly Convex Drawings of Planar Graphs
Rote, Guenter
[J]. PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 728 - 734
[8] Strictly convex drawings of planar graphs
Barany, Imre
Rote, Guenter
[J]. DOCUMENTA MATHEMATICA, 2006, 11 : 369 - 391
[9] Convex drawings of 3-connected plane graphs extended abstract
Bonichon, N
Felsner, S
Mosbah, M
[J]. GRAPH DRAWING, 2004, 3383 : 60 - 70
[10] Succinct strictly convex greedy drawing of 3-connected plane graphs
Wang, Jiun-Jie
He, Xin
[J]. THEORETICAL COMPUTER SCIENCE, 2014, 532 : 80 - 90

← 1 2 3 4 5 →