Skip to main content
SpringerLink
Log in

Bend Minimization for Orthogonal Drawings of Plane Graphs

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 92 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Bertolazzi P, Di Battista G, Didimo W (2000) Computing orthogonal drawings with the minimum number of bends. IEEE Trans Comput 49(8):826–840

    Article  MathSciNet  Google Scholar 

  2. Biedl TC (2007) Realizations of hexagonal graph representations. In: Bose P (ed) CCCG. Carleton University, Ottawa, pp 89–92

    Google Scholar 

  3. Bläsius T, Brückner G, Rutter I (2014) Complexity of higher-degree orthogonal graph embedding in the Kandinsky model. In: Schulz AS, Wagner D (eds) Algorithms – ESA 2014, Wroclaw. Lecture notes in computer science, vol 8737. Springer, Berlin/Heidelberg, pp 161–172

    Google Scholar 

  4. Cornelsen S, Karrenbauer A (2012) Accelerated bend minimization. J Graph Algorithms Appl 16(3):635–650

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Di Battista G, Eades P, Tamassia R, Tollis IG (1999) Graph drawing: algorithms for the visualization of graphs. Prentice-Hall, Upper Saddle River

    MATH  Google Scholar 

  7. Fößmeier U, Kaufmann M (1996) Drawing high degree graphs with low bend numbers. In: Brandenburg FJ (ed) Graph drawing. Lecture notes in computer science, vol 1027. Springer, Berlin/Heidelberg, pp 254–266

    Chapter  Google Scholar 

  8. Garg A, Tamassia R (1996) A new minimum cost flow algorithm with applications to graph drawing. In: North SC (ed). Graph Drawing, Lecture notes in computer science, vol 1190. Springer, Berlin/Heidelberg, pp 201–216

    Google Scholar 

  9. Garg A, Tamassia R (2001) On the computational complexity of upward and rectilinear planarity testing. SIAM J Comput 31(2):601–625

    Article  MathSciNet  MATH  Google Scholar 

  10. Henzinger MR, Klein PN, Rao S, Subramanian S (1997) Faster shortest-path algorithms for planar graphs. J Comput Syst Sci 55(1):3–23

    Article  MathSciNet  MATH  Google Scholar 

  11. Tamassia R (1987) On embedding a graph in the grid with the minimum number of bends. SIAM J Comput 16(3):421–444

    Article  MathSciNet  MATH  Google Scholar 

  12. Vijayan G, Wigderson A (1985) Rectilinear graphs and their embeddings. SIAM J Comput 14(2):355–372

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Engineering Department, Roma Tre University, Rome, Italy

    Maurizio Patrignani

Authors
  1. Maurizio Patrignani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maurizio Patrignani .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Patrignani, M. (2016). Bend Minimization for Orthogonal Drawings of Plane Graphs. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_651

Download citation

Publish with us

Policies and ethics

Search

Navigation