Accelerated bend minimization

Abstract. We present an O(n3/2) algorithm for minimizing the number of bends in an orthogonal drawing of a plane graph. It has been posed as a long standing open problem at Graph Drawing 2003, whether the bound of O(n7/4√logn) shown by Garg and Tamassia in 1996 could be improved. To answer this question, we show how to solve the uncapaci-tated min-cost flow problem on a planar bidirected graph with bounded costs and face sizes in O(n3/2) time.