平行坐标中的边捆绑算法 - 计算机辅助设计与图形学学报.pdf

第29 卷 第7 期 计算机辅助设计与图形学学报 Vol. 29 No.7 2017 年7 月 Journal of Computer-Aided Design Computer Graphics Jul. 2017 平行坐标中的边捆绑算法 1,2) 1,2) 秦红星 , 卫学仕 1) (重庆邮电大学计算机科学与技术学院 重庆 400065) 2) (重庆邮电大学计算智能重庆市重点实验室 重庆 400065) (qinhx@cqupt.edu.cn) : 针对大规模数据平行坐标可视化方案中的视觉混淆严重阻碍了信息的正确传递, 而现有平行坐标边捆绑算 法在连接端的混叠区域不能准确地表达数据量的大小的问题, 提出一种边捆绑算法. 首先将每个轴上的聚类根据连 接关系进一步划分为几个组, 然后对组进行重新规划和排序并建立组的连接, 最后将所有组用不同的颜色属性进行 独立渲染. 为了增强视觉有效性表达, 文中设计了交互界面以高亮显示不同的组. 实验结果表明, 该算法对大规模高 维数据可视化具有有效性, 并保持了连接关系的视觉连续性. : 数据可视化; 平行坐标; 视觉混淆; 边捆绑; 聚类 : TP391.41 A Study on Edge Bundling Technology in Parallel Coordinates Qin Hongxing1,2) and Wei Xueshi1,2) 1) (Chongqing University of Posts and Telecommunications, Institute of Computer Science and Technology, Chongqing 400065) 2) (Chongqing Key Laboratory of Computational Intelligence, Chongqing 400065) Abstract: Visual clutter caused by a large data set seriously hampers the presentation accuracy of informa- tion in parallel coordinates. The number of items in every cluster cannot be accurately expressed in the overlap region in previous methods. In the paper, we propose an edge-bundling method to solve the problem. Each cluster in the axis is first divided to several groups in terms of the connection. Then, the connection between groups is used to reorder groups. Finally, all groups are rendered independently with different col- ors. In order to enhance visual effects, we design an interactive interface to highlight the selected group. Experiments show that our approach is effective to visualize a large data set in parallel coordinates and the visual continuity of the connection relation is preserved well. Key words: data visualizat