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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Dujmović, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. Comput. Geom. 38(3), 194–212 (2007)
Fáry, I.: On straight line representation of planar graphs. Acta Sci. Math. Szeged 11, 229–233 (1948)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)
Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. Lecture Notes Series on Computing, vol. 12. World Scientific Publishing Co., Singapore (2004)
Purchase, H.C.: Which aesthetic has the greatest effect on human understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248–261. Springer, Heidelberg (1997)
Rahman, M.S., Egi, N., Nishizeki, T.: No-bend orthogonal drawings of series-parallel graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 409–420. Springer, Heidelberg (2006)
Samee, M.A.H.: Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three. M.Sc. Engineering Thesis, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (July 2008)
Schnyder, W.: Embedding planar graphs on the grid. In: First ACM-SIAM Symp. on Discrete Algorithms, pp. 138–148 (1990)
Stein, K.S.: Convex maps. Amer. Math. Soc. 2, 464–466 (1951)
Wagner, K.: Bemerkungen zum vierfarbenproblem. Jahresber. Deutsch. Math-Verein. 46, 26–32 (1936)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Samee, M.A.H., Alam, M.J., Adnan, M.A., Rahman, M.S. (2009). Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three. In: Tollis, I.G., Patrignani, M. (eds) Graph Drawing. GD 2008. Lecture Notes in Computer Science, vol 5417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00219-9_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-00219-9_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00218-2
Online ISBN: 978-3-642-00219-9
eBook Packages: Computer ScienceComputer Science (R0)