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

Md Rezaul Karim,Md Saidur Rahman,Md Jawaherul Alam

doi:10.1007/978-3-642-00202-1_27

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

Md Rezaul Karim, Md Saidur Rahman + Show 1 more

https://doi.org/10.1007/978-3-642-00202-1_27

Copy DOI

Publication Date: Jan 1, 2009

Citations: 6

Affiliation: Bangladesh University of Engineering and Technology, University of Dhaka

#Straight-line Grid Drawing #Outerplanar Graphs + Show 8 more

Abstract
Full-Text PDF
Similar Papers

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.

Full Text