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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Cimikowski, R. and Shope, P.: A neural-network algorithm for a graph layout problem, IEEE Trans. Neural Networks 7 (1996), 341–345.
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.
Kaveh, A.: Space structures and crossing number of their graphs, Mech. Struct. Mach. 21 (1993), 151–166.
Henderson, J. C. de C.: Topological aspects of structural analysis, Aircraft Engng. 32 (1960), 137–141.
Kaveh, A.: Structural Mechanics: Graph and Matrix Methods, 2nd edn, Research Studies Press, (Wiley), London, 1995.
Mansfield, A.: Determining the thickness of graphs is NP-hard, Math. Proc. Cambridge Philos. Soc. 93 (1983), 9–23.
Beineke, L.W.: Topology, In: L.W. Beineke and R. J. Wilson (eds), Graph Connections, Oxford Science Publ., 1996, pp. 155–173.
Alekseev, V. B. and Goncakov, V. S.: The thickness of an arbitrary complete graph, Math. Sbornik 30 (1976), 187–202.
Mutzel, P., Odenthal T. and Scharbrodt, M.: The thickness of graphs; a survey, Graphs Combinatorics 14 (1998), 59–73.
Kaveh, A.: Optimal Structural Analysis, Research Studies Press (Wiley), London, 1997.
Kaveh, A. and Rahami, H.: Planar drawing of space structures using algebraic graph theory, Asian J. Civil Engng. 3 (2002), 20–32.
King, I. P.: An automatic reordering scheme for simultaneous equations derived from network systems, Internat. J. Numer. Meth. Engng. 2 (1970), 523–533.
Author information
Authors and Affiliations
Rights 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
Issue Date:
DOI: https://doi.org/10.1023/A:1021616706461