Straight-line grid drawings of label-constrained outerplanar graphs with O(nlogn) area

被引：1

作者：

Karim M.R. ^{[1
,2
]}

Alam M.J. ^{[1
]}

Rahman M.S. ^{[1
]}

机构：

[1] Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET)

[2] Department of Computer Science and Engineering, University of Dhaka

来源：

Journal of Graph Algorithms and Applications | 2011年 / 15卷 / 03期

关键词：

D O I：

10.7155/jgaa.00233

中图分类号：

学科分类号：

摘要：

A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings. Any outerplanar graph of n vertices with maximum degree d has a straight-line grid drawing with area O(dnlogn). In this paper, we introduce a subclass of outerplanar graphs, which we call label-constrained outerplanar graphs, that admits straight-line grid drawings with O(nlogn) area. We give a linear-time algorithm to find such a drawing. We also give a linear-time algorithm for the recognition of label-constrained outerplanar graphs.

引用

页码：437 / 456

页数：19

共 32 条

[21] On the area requirements of planar straight-line orthogonal drawings of ternary trees
Covella, Barbara
Frati, Fabrizio
Patrignani, Maurizio
THEORETICAL COMPUTER SCIENCE, 2021, 852 : 197 - 211
[22] Optimizing area and aspect ratio in straight-line orthogonal tree drawings
Chan, TM
Goodrich, MT
Kosaraju, SR
Tamassia, R
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2002, 23 (02): : 153 - 162
[23] A practical algorithm for planar straight-line grid drawings of general trees with linear area and arbitrary aspect ratio
Rusu, Adrian
Santiago, Confesor
11TH INTERNATIONAL CONFERENCE INFORMATION VISUALIZATION, 2007, : 743 - +
[24] OPTIMAL PARALLEL ALGORITHMS FOR STRAIGHT-LINE GRID EMBEDDINGS OF PLANAR GRAPHS
KAO, MY
FURER, M
HE, X
RAGHAVACHARI, B
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (04) : 632 - 646
[25] Compact visibility representation and straight-line grid embedding of plane graphs
Zhang, HM
He, X
ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2003, 2748 : 493 - 504
[26] Straight-line drawings of general trees with linear area and arbitrary aspect ratio
Garg, A
Rusu, A
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCA 2003, PT 3, PROCEEDINGS, 2003, 2669 : 876 - 885
[27] A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs
Hong, SH
Eades, P
GRAPH DRAWING, 2004, 3383 : 307 - 317
[28] CANONICAL ORDERING FOR GRAPHS ON THE CYLINDER, WITH APPLICATIONS TO PERIODIC STRAIGHT-LINE DRAWINGS ON THE FLAT CYLINDER AND TORUS
Aleardi, Luca Castelli
Devillers, Olivier
Fusy, Eric
JOURNAL OF COMPUTATIONAL GEOMETRY, 2018, 9 (01) : 391 - 429
[29] 3D straight-line grid drawing of 4-colorable graphs
Calamoneri, T
Sterbini, A
INFORMATION PROCESSING LETTERS, 1997, 63 (02) : 97 - 102
[30] Area-efficient order-preserving planar straight-line drawings of ordered trees
Garg, A
Rusu, A
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2003, 13 (06) : 487 - 505

← 1 2 3 4 →