可视化带有节点和边标签的图

摘要：

当绘制其边与节点包含文本或图形得图形时，此类信息需要以不重叠得方式显示，无论是作为初始布局得一部分还是作为后处理步骤. 去除重叠的核心问题在于保持布局中固有的结构信息，最大限度地减 少所需的额外面积，并保持边尽可能地直.针对这一问题，提出了一种统一的节点和边重叠去除算法。

英文摘要：

When drawing graphs whose edges and nodes contain text or graphics, such informa tion 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 unified node and edge overlap removal algorithm that does well at solving this problem.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。