A Fast Convergence Layout Algorithm for Drawing Graphs in Marching-Graph

UTSePress Research/Manakin Repository

Search UTSePress Research

Advanced Search


My Account

Show simple item record

dc.contributor.author Quan, Wu en_US
dc.contributor.author Huang, Mao Lin en_US
dc.contributor.editor en_US
dc.date.accessioned 2010-05-28T09:47:32Z
dc.date.available 2010-05-28T09:47:32Z
dc.date.issued 2008 en_US
dc.identifier 2008000714 en_US
dc.identifier.citation Quan Wu and Huang Mao 2008, 'A Fast Convergence Layout Algorithm for Drawing Graphs in Marching-Graph', China Science Press, vol. 19, no. 8, pp. 1920-1932. en_US
dc.identifier.issn 1000-9825 en_US
dc.identifier.other C1 en_US
dc.identifier.uri http://hdl.handle.net/10453/9120
dc.description.abstract 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. en_US
dc.language en_US
dc.publisher China Science Press en_US
dc.title A Fast Convergence Layout Algorithm for Drawing Graphs in Marching-Graph en_US
dc.parent Ruanjian Xuebao - Journal of Software en_US
dc.journal.volume 19 en_US
dc.journal.number 8 en_US
dc.publocation Beijing, China en_US
dc.identifier.startpage 1920 en_US
dc.identifier.endpage 1932 en_US
dc.cauo.name INEXT Research Strength Core en_US
dc.conference Verified OK en_US
dc.for 080300 en_US
dc.personcode 10112290 en_US
dc.personcode 990771 en_US
dc.percentage 100 en_US
dc.classification.name Computer Software en_US
dc.classification.type FOR-08 en_US
dc.edition print en_US
dc.custom en_US
dc.date.activity en_US
dc.location.activity en_US
dc.description.keywords graph and network visualization; graph drawing; information analytic; information visualization system; visual design en_US
dc.staffid en_US
dc.staffid 990771 en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record