Geodesic
Minimum-Area Drawings of Plane 3-Trees
Journal of Graph Algorithms and Applications, Tome 15 (2011) no. 2, pp. 177-204.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

A straight-line grid drawing of a plane graph G is a planar drawing of G, where each vertex is drawn at a grid point of an integer grid and each edge is drawn as a straight-line segment. The height, width and area of such a drawing are respectively the height, width and area of the smallest axis-aligned rectangle on the grid which encloses the drawing. A minimum-area drawing of a plane graph G is a straight-line grid drawing of G where the area is the minimum. It is NP-complete to determine whether a plane graph G has a straight-line grid drawing with a given area or not. In this paper we give a polynomial-time algorithm for finding a minimum-area drawing of a plane 3-tree. Furthermore, we show a ⎣[(2n)/3]−1⎦×2⎡[(n)/3]⎤ lower bound for the area of a straight-line grid drawing of a plane 3-tree with n ≥ 6 vertices, which improves the previously known lower bound ⎣[(2(n−1))/3]⎦×⎣[(2(n−1))/3]⎦ for plane graphs. We also explore several interesting properties of plane 3-trees. Keywords. Graph drawing, Minimum area, Minimum layer, Plane 3-tree, Lower bound.
DOI : 10.7155/jgaa.00222
Keywords: Graph drawing, Minimum area, Minimum layer, Plane 3-tree, Lower bound 
@article{JGAA_2011_15_2_a0,
     author = {Debajyoti Mondal and Rahnuma Islam Nishat and Md. Saidur Rahman and Muhammad Jawaherul Alam},
     title = {Minimum-Area {Drawings} of {Plane} {3-Trees}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {177--204},
     publisher = {mathdoc},
     volume = {15},
     number = {2},
     year = {2011},
     doi = {10.7155/jgaa.00222},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00222/}
}
TY  - JOUR
AU  - Debajyoti Mondal
AU  - Rahnuma Islam Nishat
AU  - Md. Saidur Rahman
AU  - Muhammad Jawaherul Alam
TI  - Minimum-Area Drawings of Plane 3-Trees
JO  - Journal of Graph Algorithms and Applications
PY  - 2011
SP  - 177
EP  - 204
VL  - 15
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00222/
DO  - 10.7155/jgaa.00222
LA  - en
ID  - JGAA_2011_15_2_a0
ER  - 
%0 Journal Article
%A Debajyoti Mondal
%A Rahnuma Islam Nishat
%A Md. Saidur Rahman
%A Muhammad Jawaherul Alam
%T Minimum-Area Drawings of Plane 3-Trees
%J Journal of Graph Algorithms and Applications
%D 2011
%P 177-204
%V 15
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00222/
%R 10.7155/jgaa.00222
%G en
%F JGAA_2011_15_2_a0
Debajyoti Mondal; Rahnuma Islam Nishat; Md. Saidur Rahman; Muhammad Jawaherul Alam. Minimum-Area Drawings of Plane 3-Trees. Journal of Graph Algorithms and Applications, Tome 15 (2011) no. 2, pp. 177-204. doi : 10.7155/jgaa.00222. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00222/

Cité par Sources :