Based on the theory and technology of data visualization, this paper improves some layout algorithms regarding its own natures and characteristics. It also discusses the problem of how to choose proper layout algorithm for specific data to make the visualization better. Using the improved algorithms, we can simply convert a series of complex data into more expressive images as to convey the imp...

The analysis of patterns in graphs has applications in many fields of science. We propose a new method for analyzing graph patterns consisting of a user-friendly and flexible mechanism to specify patterns, an algorithm to recognize multiple appearances of patterns in a target graph, a pattern preserving layout algorithm, and a navigation technique to explore the underlying structure of the grap...

This work explains the development of a novel approach to beautify a face, merging an evolutionary approach and aesthetics graph drawing. The objective of this work is to build a beautify face seen against the input face. The aesthetics graph drawing algorithm works as the mutation operator. The approach of force-directed graph drawing which in turn is the solution to aesthetical graph drawing ...

Force-directed layout algorithms produce graph drawings by resolving a system of emulated physical forces. We present techniques for using social gravity as an additional force in force-directed layouts, together with a scaling technique, to produce drawings of trees and forests, as well as more complex social networks. Social gravity assigns mass to vertices in proportion to their network cent...

We report on our experiments with ve graph drawing algorithms for general undirected graphs. These are the algorithms FR in-and Mehldau 6]. Implementations of these algorithms have been integrated into our GraphEd system 9]. We have tested these algorithms on a wide collection of examples and with diierent settings of parameters. Our examples are from original papers and by our own. The obtaine...

In this paper we present a generic algorithm for drawing sequences of graphs. This algorithm works for different layout algorithms and related metrics and adjustment strategies. It differs from previous work on dynamic graph drawing in that it considers all graphs in the sequence (offline) instead of just the previous ones (online) when computing the layout for each graph of the sequence. We in...

This paper introduces a force-directed layout method for creating origin-destination flow maps. Design principles derived from manual cartography and automated graph drawing to increase readability of flow maps and graph layouts are taken into account. The origin-destination flow maps produced with our algorithm show flows with quadratic Bézier curves that reduce flow-on-flow and flow-on-node o...

We introduce a force-directed algorithm, called Sync-andBurst, which falls into the category of classical force-directed graph drawing algorithms. A distinct feature in Sync-and-Burst is the use of simplified forces of attraction and repulsion whose magnitude does not depend on the distance between vertices. Instead, magnitudes are uniform throughout the graph at each iteration and monotonicall...

A major factor affecting the readability of a graph drawing is its resolution. In the graph drawing literature, the resolution of a drawing is either measured based on the angles formed by consecutive edges incident to a common node (angular resolution) or by the angles formed at edge crossings (crossing resolution). In this paper, we evaluate both by introducing the notion of “total resolution...

グラフデータの視覚化技術は,近年活発に研究が進められており,金融・交通・通信・社会組織・科学・計算機システム・ インターネットなど,非常に幅広い分野のデータ分析およびデータ監視の目的での実用が報告されている.グラフデータの視 覚化における最も大きな問題は,「グラフを誤読させない適切なノードの画面配置を,自動的に実現する」という問題である. この問題を解決するために,ノードに分子間力モデル,アークにバネモデルを適用して,運動方程式によって良質なノード配 置結果を得る手法が提案されている. 本論文では,上記のような「力学モデルを用いたグラフデータの画面配置手法」の改良手法および階層型グラフデータへの 拡張手法を提案する.本手法は,ノードを1個ずつ配置するインクリメンタルなアルゴリズムにより,配置結果を改善すると ともに,計算時間の増加を抑えることに成功している. また本論文では,上記手法...