一个去除边标签重叠的扩充张力模型

在图的最优可视化过程中，当图的边和节点都包含文字或图形标签时，显示这些标签必须保证它们互相不重叠. 这项工作可以融入初始布局的一部分，或作为后处理步骤. 去除重叠的核心问题在于保持布局中固有的结构信息，最大限度地减 少所需的额外面积，并保持边尽可能地直. 提出了一种同时去除节点和边的标签重叠的计算方法. 该算法基于最小化一个目标函数， 使得图的布局尽少改变，并保持边的平直.

An augmented proximity stress model for edge labeloverlap removal

When drawing graphs whose edges and nodes both contain text or graphics, such information needs to be displayed without overlaps, either as part of the initial layout or as a post-processing step. The core problem in removing overlaps lies in retaining the structural information inherent in a layout, minimizing the additional area required, and keeping edges as straight as possible. This paper presents a combined node and edge overlap removal algorithm that aims at offering one solution to this problem, based on minimizing a cost function that both reduces topological changes to the original drawing, and keeps edges straight.