How it works

First, the Boyer-Myrvold algorithm decides whether the graph can be embedded in the plane without crossings. If it is planar, the steps taken by the Chrobak-Payne algorithm whilst computing a planar embedding are visualized in the panel on the right.