通过生长树消除节点重叠
Node Overlap Removal by Growing a Tree
摘要：
在许多场景中，节点重叠删除是必要的步骤，包括布局图或可视化标记云。我们的贡献是一个新的重叠消除算法，迭代建立一个最小生成树的节点中心的德洛内三角剖分和删除节点重叠的“增长”的树。该算法实现简单，但能产生高质量的布局。根据我们的实验，它比目前最先进的方法快几倍。
英文摘要：
Node overlap removal is a necessary step in many scenarios including laying out a graph, or visualizing a tag cloud. Our contribution is a new overlap removal algorithm that iteratively builds a Minimum Spanning Tree on a Delaunay triangulation of the node centers and removes the node overlaps by "growing" the tree. The algorithm is simple to implement yet produces high quality layouts. According to our experiments it runs several times faster than the current state-of-the-art methods.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
