If you know the graph is planar, then you can find the Tutte embedding by solving a set of linear equations [1].
However, the problem of finding a drawing that minimises the number of edge crossings (or even just the number of crossings in such a layout [e.g., 2]) for a general graph is NP-hard.