An Efficient Algorithm for Embedding Nonplanar Graphs in Planes

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.