Efficient Optimal Bend Minimization

by Dzmitry Sledneu for OGDF - Open Graph Drawing Framework

I would like to implement the bend minimization algorithm for planar graphs with maximum degree 4, where the first bend on each edge is for free and the cost function of each edge is convex. The algorithm will be integrated into the orthogonal drawing framework.