Skip to main content
SpringerLink
Log in

An efficient orthogonal grid drawing algorithm for cubic graphs

  • Session 1B: Graph Drawing
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1995)

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

Included in the following conference series:

Abstract

In this paper we present a new algorithm that constructs an orthogonal drawing of a graph G with degree at most three. Even if we do not require any limitations neither to planar nor to biconnected graphs, we reach the best known results in the literarture: each edge has at most 1 bend, the total number of bends is ≤ n/2+1, and the area is ≤(n/2−1)2.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A., Hopcroft, J. K. Ullman, J. D.: The design and analysis of computer algorithms. Addison Wesley, Reading,MA, (1973)

    Google Scholar 

  2. Biedl, T., Kant, G.: A Better Euristic for Orthogonal Graph Drawings. Algorithms — ESA '94. Proceedings, Lectures Notes in Computer Science, Springer-Verlag 855 (1994) 24–35

    Google Scholar 

  3. Bjorken, J.D., Drell, S.D.: Quantum Electrodynamics. Mc-Graw Hill

    Google Scholar 

  4. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. the MIT Press, Cambridge,MA, (1990)

    Google Scholar 

  5. Di Battista, G., Liotta, G., Vargiu, F.: Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs. Lectures Notes in Computer Science, Springer-Verlag 709 (1993) 151–162

    Google Scholar 

  6. Greenlaw, R., Petreschi, R.: Cubic graphs, Tech. Rep. University of New Hampshire, Durham,N.H.,USA 15 (1993)

    Google Scholar 

  7. Kant, G.: Drawing Planar Graphs Using the canonical ordering. Algorithmica — Special Issue on Graph Drawing (to appear)

    Google Scholar 

  8. Liu, Y. Marchioro, P., Petreschi, R.: At most single bend embedding of cubic graphs. Applied Mathematics (Chin. Journ.) 9/B/2 (1994) 127–142

    Google Scholar 

  9. Papakostas, A., Tollis, I.G.: Improved Algorithms and Bounds for Orthogonal Drawings. Proc.Graph Drawing '94, Lectures Notes in Computer Science, Springer-Verlag 894 (1994) 40–51

    Google Scholar 

  10. Preparata, F.P., Vuillemin, J.: The Cube-Connected Cycles: A Versatile Network for Parallel Computation. Communications of ACM 24/5 (1981) 300–309

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Rome “La Sapienza”, Via Salaria 113, 00198, Roma, Italy

    Tiziana Calamoneri & Rossella Petreschi

Authors
  1. Tiziana Calamoneri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rossella Petreschi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Calamoneri, T., Petreschi, R. (1995). An efficient orthogonal grid drawing algorithm for cubic graphs. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030817

Download citation

  • DOI: https://doi.org/10.1007/BFb0030817

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation