We present an O(n 3/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(n 7/4 √ log n) shown by Garg and Tamassia in 1996 could be improved. To answer this question, we show how to solve the uncapacitated min-cost flow problem on a planar bidirected graph with bounded costs and face sizes in O(n 3/2 ) time.
The core is a min-cost flow algorithm to minimize the number of bends in the second phase REF .
Accelerated bend minimization
Lecture Notes in Computer Science
Lecture Notes in Computer Science
Mathematics Computer Science