A Force-Directed Algorithm for Drawing Directed Graphs Symmetrically. (19th November 2018)

• Record Type: Journal Article
• Authors: Xu, Taihua; Yang, Jie; Gou, Guanglei
• Other Names: Hitzer Eckhard Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2018(2018)
• Publication Date: 2018-11-19
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2018/6208509
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : Symmetry is one of the most important aesthetic criteria on graph drawing. It is quite necessary to measure the extent to which the drawings can be considered symmetric. For this purpose, a symmetric metric based on vertex coordinate calculation is proposed in this paper. It is proven theoretically and experimentally that the proposed metric is robust to contraction, expansion, and rotation of drawings. This robustness conforms to human perception of symmetry. Star-subgraphs and cycles are two common structures in digraphs. Both of them have inherent symmetry which should be displayed in drawings. For this purpose, a force-directed algorithm named FDS is proposed which can draw star-subgraphs and cycles as symmetrically as possible. FDS algorithm draws cycles as circles whose positions are fixed to provide a scaffolding for overall layout, renders non-leaf vertices by a standard force-directed layout, and places leaf vertices on concentric circles via a deterministic strategy. A series of experiments are carried out to test FDS algorithm. The results show that FDS algorithm draws digraphs more symmetrically than the existing state-of-the-art algorithms and performs efficiency comparable to O ( n log ⁡ n ) YFHu algorithm.