一种消除图形与地图二义性的着色算法
A Coloring Algorithm for Disambiguating Graph and Map Drawings
摘要:
绘制非平面图总是会导致边交叉。当有许多以小角度交叉的边缘时,通常很难跟随这些边缘,因为交叉导致的多个视觉路径减慢了眼睛的运动。在本文中,我们提出了一种算法,消除歧义的边缘与自动选择的独特的颜色。我们提出的算法计算一个接近最佳的颜色分配的双重碰撞图,使用一种新的分支定界过程应用到空间分解的色域。我们给出的例子表明这种方法在澄清现实世界的图形和地图的图纸的有效性。
英文摘要:
Drawings of non-planar graphs always result in edge crossings. When there are many edges crossing at small angles, it is often difficult to follow these edges, because of the multiple visual paths resulted from the crossings that slow down eye movements. In this paper we propose an algorithm that disambiguates the edges with automatic selection of distinctive colors. Our proposed algorithm computes a near optimal color assignment of a dual collision graph, using a novel branch-and-bound procedure applied to a space decomposition of the color gamut. We give examples demonstrating the effectiveness of this approach in clarifying drawings of real world graphs and maps.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。