Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)

Authors:
Md. Rezaul Karim;Md. Jawaherul Alam;Md. Saidur Rahman
Affiliations:
Dept. of Computer Science and Engineering, Bangladesh University of Engineering and Technology(BUET), Dhaka, Bangladesh 1000 and Dept. of Computer Science and Engineering, University of Dhaka, Dha ...;Dept. of Computer Science and Engineering, Bangladesh University of Engineering and Technology(BUET), Dhaka, Bangladesh 1000;Dept. of Computer Science and Engineering, Bangladesh University of Engineering and Technology(BUET), Dhaka, Bangladesh 1000
Venue:
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Year:
2009

Citing 4
Cited 1

Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Drawing Outer-Planar Graphs in O(n log n) Area

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Four-connected spanning subgraphs of doughnut graphs

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Small area drawings of outerplanar graphs

GD'05 Proceedings of the 13th international conference on Graph Drawing

Straight-line drawings of outerplanar graphs in O(dnlogn) area

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 the maximum degree d has a straight-line grid drawing with area O (dn logn ). 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 (n logn ) area. We give a linear-time algorithm to find such a drawing. We also give a linear-time algorithm for recognition of label-constrained outerplanar graphs.