Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Graph Compact Orthogonal Layout Algorithm

  • Conference paper
  • First Online:
Combinatorial Optimization (ISCO 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8596))

Included in the following conference series:

Abstract

There exist many orthogonal graph drawing algorithms that minimize edge crossings or edge bends, however they produce unsatisfactory drawings in many practical cases. In this paper we present a grid-based algorithm for drawing orthogonal graphs with nodes of prescribed size. It distinguishes by creating pleasant and compact drawings in relatively small running time. The main idea is to minimize the total edge length that implicitly minimizes crossings and makes the drawing easy to comprehend. The algorithm is based on combining local and global improvements. Local improvements are moving each node to a new place and swapping of nodes. Global improvement is based on constrained quadratic programming approach that minimizes the total edge length while keeping node relative positions.

Supported in part by project No. 2013/0033/2DP/2.1.1.1.0/13/APIA/VIAA/027.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 EPUB and 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

Similar content being viewed by others

References

  1. Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3), 159–180 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Biedl, T.C., Kaufmann, M.: Area-efficient static and incremental graph drawings. In: Burkard, R., Woeginger, G. (eds.) ESA 1997. LNCS, vol. 1284, pp. 37–52. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  3. Biedl, T.C., Madden, B.P., Tollis, I.G.: The three-phase method: a unified approach to orthogonal graph drawing. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 391–402. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. Bridgeman, S., Fanto, J., Garg, A., Tamassia, R., Vismara, L.: Interactivegiotto: an algorithm for interactive orthogonal graph drawing. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 303–308. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  5. Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M.: Orthogonal and Quasi-upward drawings with vertices of prescribed size. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 297–310. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Comput. Geom. 7(5), 303–325 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 153–164. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Fößmeier, U., Heß, C., Kaufmann, M.: On improving orthogonal drawings: the 4M-Algorithm. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 125–137. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Fößmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 254–266. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  10. Freivalds, K., Kikusts, P.: Optimum layout adjustment supporting ordering constraints in graph-like diagram drawing. In: Proceedings of Latvian Academy of Sciences, Section B, No. 1, pp. 43–51 (2001)

    Google Scholar 

  11. Hachul, S., Jünger, M.: An experimental comparison of fast algorithms for drawing general large graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 235–250. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Kojima, K., Nagasaki, M., Miyano, S.: Fast grid layout algorithm for biological networks with sweep calculation. Bioinformatics 24(12), 1433–1441 (2008)

    Article  Google Scholar 

  13. Kojima, K., Nagasaki, M., Miyano, S.: An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location information. BMC Bioinformatics 11, 335 (2010)

    Article  Google Scholar 

  14. Lengauer, T.: Combinatorial algorithms for integrated circuit layout. John Wiley and Sons Inc., New York (1990)

    MATH  Google Scholar 

  15. Li, W., Kurata, H.: A grid layout algorithm for automatic drawing of biochemical networks. Bioinformatics 21(9), 2036–2042 (2005)

    Article  Google Scholar 

  16. Six, J.M., Kakoulis, K.G., Tollis, I.G., et al.: Techniques for the refinement of orthogonal graph drawings. J. Graph Algorithms Appl. 4(3), 75–103 (2000)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, University of Latvia, Raina Bulvaris 29, Riga, LV-1459, Latvia

    Kārlis Freivalds & Jans Glagoļevs

Authors
  1. Kārlis Freivalds
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jans Glagoļevs
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kārlis Freivalds .

Editor information

Editors and Affiliations

  1. Univ Pierre et Marie Curie LIP6, Paris, France

    Pierre Fouilhoux

  2. Universidade de Lisboa, Lisbon, Portugal

    Luis Eduardo Neves Gouveia

  3. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    A. Ridha Mahjoub

  4. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    Vangelis T. Paschos

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Freivalds, K., Glagoļevs, J. (2014). Graph Compact Orthogonal Layout Algorithm. In: Fouilhoux, P., Gouveia, L., Mahjoub, A., Paschos, V. (eds) Combinatorial Optimization. ISCO 2014. Lecture Notes in Computer Science(), vol 8596. Springer, Cham. https://doi.org/10.1007/978-3-319-09174-7_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09174-7_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09173-0

  • Online ISBN: 978-3-319-09174-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation