Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three

Authors:
Md. Abul Samee;Md. Jawaherul Alam;Muhammad Abdullah Adnan;Md. Saidur Rahman
Affiliations:
Department of Computer Science, University of Illinois at Urbana-Champaign, USA;Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh
Venue:
Graph Drawing
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
Which Aesthetic has the Greatest Effect on Human Understanding?

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Drawings of planar graphs with few slopes and segments

Computational Geometry: Theory and Applications
No-bend orthogonal drawings of series-parallel graphs

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

Minimum-segment convex drawings of 3-connected cubic plane graphs

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A minimum segment drawing Γ of a planar graph G is a straight line drawing of G that has the minimum number of segments among all straight line drawings of G . In this paper, we give a linear-time algorithm for computing a minimum segment drawing of a series-parallel graph with the maximum degree three. To the best of our knowledge, this is the first algorithm for computing minimum segment drawings of an important subclass of planar graphs.