%0 Journal Article
%T Fast Convergence Layout Algorithm for Drawing Graphs in Marching-Graph<br>一种用于Marching—Graph图形绘制的快速收敛布局算法
%A QUAN Wu
%A HUANG Mao-Lin
%A <br>全武
%A 黄茂林
%J 软件学报
%D 2008
%I 
%X Marching-Graph is a new visualization that integrates the graph metaphor and the spatial metaphor into a single visualization.It provides users with highly interactive maps for accessing the logical structures of information that has the geographical attributes.Instead of presenting known facts onto maps,it provides a mechanism for users to visually analyze and seek unknown knowledge through effective human-map interaction and navigation across different spaces.However,the traditional force-directed layout algorithms are very slow in reaching an equilibrium configuration of forces.They usually spend tens of seconds making the layout of a graph converge.Thus,those force-directed layout algorithms can not satisfy the requirement for drawing a sequence of graphs rapidly,while the users are quickly marching through the geographic regions.This paper proposes a fast convergence layout method that speeds up the interaction time while users are progressively exploring a sequence of graphs through a series of force-directed layouts in Marching-Graph.It essentially combines a radial tree drawing method and a force-directed graph drawing method to achieve the fast convergence of energy minimization.
%K graph and network visualization
%K graph drawing
%K information analytic
%K information visualization system
%K visual design<br>图形和网络可视化
%K 图形绘制
%K 信息分析
%K 信息可视化系统
%K 可视设计
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=95A5D2F7AEBF94BC555394CF21D84786&yid=67289AFF6305E306&vid=2A8D03AD8076A2E3&iid=5D311CA918CA9A03&sid=245C5ED8B3BAFA8A&eid=274950DACC45EFF5&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=14