Polynomial area bounds for MST embeddings of trees
Computational Geometry: Theory and Applications
Small grid drawings of planar graphs with balanced bipartition
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Straight-line drawings of outerplanar graphs in O(dnlogn) area
Computational Geometry: Theory and Applications
Small grid drawings of planar graphs with balanced partition
Journal of Combinatorial Optimization
h-quasi planar drawings of bounded treewidth graphs in linear area
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Universal point sets for planar three-trees
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Hi-index | 0.00 |
We show three linear-time algorithms for constructing planar straight-line grid drawings of outerplanar graphs. The first and the second algorithm are for balanced outerplanar graphs. Both require linear area. The drawings produced by the first algorithm are not outerplanar while those produced by the second algorithm are. On the other hand, the first algorithm constructs drawings with better angular resolution. The third algorithm constructs outerplanar drawings of general outerplanar graphs with O(n 1.48) area. Further, we study the interplay between the area requirements of the drawings of an outerplanar graph and the area requirements of a special class of drawings of its dual tree.