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