fCoSE: A Fast Compound Graph Layout Algorithm with Constraint Support

被引:6
|
作者
Balci, Hasan [1 ]
Dogrusoz, Ugur [1 ]
机构
[1] Bilkent Univ, I Vis Informat Visualizat Res Lab, Dept Comp Engn, TR-06800 Ankara, Turkey
关键词
Layout; Compounds; Stress; Data visualization; Time complexity; Springs; Heuristic algorithms; Information visualization; graph layout; visual analytics; compound graphs; constrained layout; spectral graph drawing; VISUALIZATION;
D O I
10.1109/TVCG.2021.3095303
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Visual analysis of relational information is vital in most real-life analytics applications. Automatic layout is a key requirement for effective visual display of such information. This article introduces a new layout algorithm named fCoSE for compound graphs showing varying levels of groupings or abstractions with support for user-specified placement constraints. fCoSE builds on a previous compound spring embedder layout algorithm and makes use of the spectral graph drawing technique for producing a quick draft layout, followed by phases where constraints are enforced and compound structures are properly shown while polishing the layout with respect to commonly accepted graph layout criteria. Experimental evaluation verifies that fCoSE produces quality layouts and is fast enough for interactive applications with small to medium-sized graphs by combining the speed of spectral graph drawing technique with the quality of force-directed layout algorithms while satisfying specified constraints and properly displaying compound structures. An implementation of fCoSE along with documentation and a demo page is freely available on GitHub at https://github.com/iVis-at-Bilkent/cytoscape.js-fcose.
引用
收藏
页码:4582 / 4593
页数:12
相关论文
共 50 条
  • [31] A multi-constraint Layout Algorithm for Dynamic Network Visualization
    Du, Xiaolei
    Wei, Yingmei
    Wu, Lingda
    2017 IEEE 2ND INTERNATIONAL CONFERENCE ON BIG DATA ANALYSIS (ICBDA), 2017, : 832 - 836
  • [32] RESEARCH ON THE CONSTRUCTION LAYOUT OF URBAN SPORTS PARK BASED ON CONSTRAINT GRAPH MODEL
    Li, Bai
    OPEN HOUSE INTERNATIONAL, 2019, 44 (03) : 24 - 27
  • [33] Fast Algorithm for Graph Isomorphism Testing
    Luis Lopez-Presa, Jose
    Fernandez Anta, Antonio
    EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2009, 5526 : 221 - +
  • [34] Fast graph search multiprocessor algorithm
    Subramaniam, PRV
    Cheng, KH
    PROCEEDINGS OF THE IEEE 1997 AEROSPACE AND ELECTRONICS CONFERENCE - NAECON 1997, VOLS 1 AND 2, 1997, : 247 - 254
  • [35] A FAST BACKTRACK ALGORITHM FOR GRAPH ISOMORPHISM
    MITTAL, HB
    INFORMATION PROCESSING LETTERS, 1988, 29 (02) : 105 - 110
  • [36] A FAST ALGORITHM FOR THE PRINCIPAL PARTITION OF A GRAPH
    PATKAR, S
    NARAYANAN, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 560 : 288 - 306
  • [37] FAST ALGORITHM FOR DETERMINATION OF BRIDGES OF A GRAPH
    MUHLBACHER, J
    ANGEWANDTE INFORMATIK, 1972, (06): : 280 - +
  • [38] Layout Algorithm for an EC-based Room Layout Planning Support System
    Inoue, Makoto
    Takagi, Hideyuki
    2008 IEEE CONFERENCE ON SOFT COMPUTING IN INDUSTRIAL APPLICATIONS SMCIA/08, 2009, : 165 - +
  • [39] Fast recognition algorithm of CRC constraint networks
    Chen, En-Hong
    Zhang, Zhen-Ya
    Wang, Xu-Fa
    Ruan Jian Xue Bao/Journal of Software, 2002, 13 (05): : 972 - 979
  • [40] A fast algorithm for balanced graph clustering
    Huang, Mao Lin
    Nguyen, Quang Vinh
    11TH INTERNATIONAL CONFERENCE INFORMATION VISUALIZATION, 2007, : 46 - +