Orthogonal graph drawing has many applications, e.g., for laying out UML diagrams or cableplans. In this paper, we present a new pipeline that draws multigraphs orthogonally, using few bends, few crossings, and small area. Our pipeline computes an initial graph layout, then removes overlaps between the rectangular nodes, routes the edges, orders the edges, and nudges them, that is, moves edge segments in order to balance the inter-edge distances. Our pipeline is flexible and integrates well with existing approaches. Our main contribution is (i) an effective edge-nudging algorithm that is based on linear programming, (ii) a selection of simple algorithms that together produce competitive results, and (iii) an extensive experimental comparison of our pipeline with existing approaches using standard benchmark sets and metrics.

翻译：正交图绘制具有众多应用，例如用于布局UML图或电缆规划。在本文中，我们提出一种新的流水线，能以正交方式绘制多重图，并实现较少的弯曲、较少交叉及较小的面积。该流水线首先计算初始图布局，然后消除矩形节点之间的重叠、布线边、对边排序，并对边进行微移——即移动边段以平衡边间距离。该流水线灵活性强，且能很好地与现有方法整合。我们的主要贡献在于：(i) 一种基于线性规划的有效边微移算法；(ii) 一组可共同产生竞争性结果的简单算法；(iii) 使用标准基准集和指标，将我们的流水线与现有方法进行广泛的实验比较。