The boost graph library seems to have planar embedding algorithms implemented for maximally planar graphs. Does it also have anything implemented to planarize a non-planar graph? Hopefully something that minimizes crossings.
I have found that the Open Graph Drawing Framework has some planarization code, but I'd rather use something in boost if it exists.
This previous question asks something similar, but not directly about the existence of such an algorithm in boost.
