5 citations · 6 across the 2 of their papers we have counts for
1 paper · 1 filter
Karlis Freivalds, Jans Glagolevs
There exist many orthogonal graph drawing algorithms that minimize edge crossings or edge bends, however they produce unsatisfactory drawings in many practical cases. In this paper…