Skip to main content
SpringerLink
Log in

An Efficient Algorithm for Embedding Nonplanar Graphs in Planes

  • Published:
Journal of Mathematical Modelling and Algorithms

Abstract

An efficient multi-step algorithm is presented for embedding a nonplanar graph on the least possible number of planes. In the first step, the graph is drawn on a plane with the smallest possible number of crossings. Then the appropriate crossing edges are selected and moved onto the second plane. This process is repeated introducing subsequent planes until no crossing remains.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cimikowski, R. and Shope, P.: A neural-network algorithm for a graph layout problem, IEEE Trans. Neural Networks 7 (1996), 341–345.

    Google Scholar 

  2. Tamasia, R., Di Battista, G. and Batini, C.: Automatic graph drawing and readability of diagrams, IEEE Trans. Sys. Man. Cybern. SMC-18 (1988), 61–79.

    Google Scholar 

  3. Kaveh, A.: Space structures and crossing number of their graphs, Mech. Struct. Mach. 21 (1993), 151–166.

    Google Scholar 

  4. Henderson, J. C. de C.: Topological aspects of structural analysis, Aircraft Engng. 32 (1960), 137–141.

    Google Scholar 

  5. Kaveh, A.: Structural Mechanics: Graph and Matrix Methods, 2nd edn, Research Studies Press, (Wiley), London, 1995.

    Google Scholar 

  6. Mansfield, A.: Determining the thickness of graphs is NP-hard, Math. Proc. Cambridge Philos. Soc. 93 (1983), 9–23.

    Google Scholar 

  7. Beineke, L.W.: Topology, In: L.W. Beineke and R. J. Wilson (eds), Graph Connections, Oxford Science Publ., 1996, pp. 155–173.

  8. Alekseev, V. B. and Goncakov, V. S.: The thickness of an arbitrary complete graph, Math. Sbornik 30 (1976), 187–202.

    Google Scholar 

  9. Mutzel, P., Odenthal T. and Scharbrodt, M.: The thickness of graphs; a survey, Graphs Combinatorics 14 (1998), 59–73.

    Google Scholar 

  10. Kaveh, A.: Optimal Structural Analysis, Research Studies Press (Wiley), London, 1997.

    Google Scholar 

  11. Kaveh, A. and Rahami, H.: Planar drawing of space structures using algebraic graph theory, Asian J. Civil Engng. 3 (2002), 20–32.

    Google Scholar 

  12. King, I. P.: An automatic reordering scheme for simultaneous equations derived from network systems, Internat. J. Numer. Meth. Engng. 2 (1970), 523–533.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Civil Engineering, Iran University of Science and Technology, Narmak, Tehran-, 16, Iran

    A. Kaveh & H. Rahami

Authors
  1. A. Kaveh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Rahami
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kaveh, A., Rahami, H. An Efficient Algorithm for Embedding Nonplanar Graphs in Planes. Journal of Mathematical Modelling and Algorithms 1, 257–268 (2002). https://doi.org/10.1023/A:1021616706461

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021616706461

Search

Navigation