Skip to main content
SpringerLink
Log in

Bend-Minimum Orthogonal Drawings of Plane 3-Graphs

Extended Abstract

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2573))

Included in the following conference series:

Abstract

In an orthogonal drawing of a plane graph, any edge is drawn as a sequence of line segments, each having either a horizontal or a vertical direction. A bend is a point where an edge changes its direction. A drawing is called a bend-minimum orthogonal drawing if the number of bends is minimum among all orthogonal drawings. This paper presents a linear-time algorithm to find a bend-minimum orthogonal drawing of any given plane 3-graph, that is, a plane graph of maximum degree three.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall Inc., Upper Saddle River, New Jersey, 1999.

    MATH  Google Scholar 

  2. G. Di Battista, G. Liotta, and F. Vargiu, Spirality and optimal orthogonal drawings, SIAM J. Comput. 27(6), pp. 1764–1811, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Garg and R. Tamassia, A new minimum cost flow algorithm with applications to graph drawing, Proc. of Graph Drawing’96, Lect. Notes in Computer Science, 1190, pp. 201–226, 1997.

    Google Scholar 

  4. T. Lengauer Combinatorial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Chichester, 1990.

    MATH  Google Scholar 

  5. S. Nakano and M. Yoshikawa, A linear-time algorithm for bend-optimal orthogonal drawings of biconnected cubic plane graphs, Proc. of Graph Drawing’00, Lect. Notes in Computer Science, 1984, pp. 296–307, 2001.

    Google Scholar 

  6. M. S. Rahman, S. Nakano and T. Nishizeki, A linear algorithm for bendoptimal orthogonal drawings of triconnected cubic plane graphs, Journal of Graph Alg. and Appl., http://www.cs.brown.edu/publications/jgaa/, 3(4), pp. 31–62, 1999.

    MATH  MathSciNet  Google Scholar 

  7. M. S. Rahman, M. Naznin and T. Nishizeki, Orthogonal drawings of plane graphs without bends, Proc. of Graph Drawing’01, Lect. Notes in Computer Science, 2265, pp. 392–406, 2002.

    Google Scholar 

  8. J. Storer, On minimum node-cost planar embeddings, Networks, 14, pp. 181–212, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  9. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput., 16, pp. 421–444, 1987.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Sciences, Tohoku University, Aoba-yama 05, 980-8579, Sendai, Japan

    Md.Saidur Rahman & Takao Nishizeki

Authors
  1. Md.Saidur Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takao Nishizeki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Karlsruhe University, Germany

    Gerhard Goos

  2. Cornell University, NY, USA

    Juris Hartmanis

  3. Utrecht University, The Netherlands

    Jan van Leeuwen

  4. Department of Applied Mathematics, Charles University, Malostranské nám. 25, 118 00, Prague, Czech Republic

    Luděk Kučera

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rahman, M., Nishizeki, T. (2002). Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. In: Goos, G., Hartmanis, J., van Leeuwen, J., Kučera, L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2002. Lecture Notes in Computer Science, vol 2573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-36379-3_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00331-1

  • Online ISBN: 978-3-540-36379-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation