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 条
  • [1] A compound graph layout algorithm for biological pathways
    Dogrusoz, U
    Giral, E
    Cetintas, A
    Civril, A
    Demir, E
    GRAPH DRAWING, 2004, 3383 : 442 - 447
  • [2] ON AN ALGORITHM TO DETECT POSITIVE CYCLES IN A CONSTRAINT GRAPH FOR LAYOUT COMPACTION
    ISHIMA, K
    TSUKIYAMA, S
    IEICE TRANSACTIONS ON COMMUNICATIONS ELECTRONICS INFORMATION AND SYSTEMS, 1991, 74 (11): : 3613 - 3616
  • [3] Constraint-based spring-model algorithm for graph layout
    Kamps, T
    Kleinz, J
    Read, J
    GRAPH DRAWING, 1996, 1027 : 349 - 360
  • [4] CoSEP: A compound spring embedder layout algorithm with support for ports
    Okka, Alihan
    Dogrusoz, Ugur
    Balci, Hasan
    INFORMATION VISUALIZATION, 2021, 20 (2-3) : 151 - 169
  • [5] Fast convergence layout algorithm for drawing graphs in marching-graph
    Quan, Wu
    Huang, Mao-Lin
    Ruan Jian Xue Bao/Journal of Software, 2008, 19 (08): : 1920 - 1932
  • [6] Fast support layout optimization
    De Meter, EC
    INTERNATIONAL JOURNAL OF MACHINE TOOLS & MANUFACTURE, 1998, 38 (10-11): : 1221 - 1239
  • [7] Fast support layout optimization
    De Meter, Edward C.
    International Journal of Machine Tools and Manufacture, 1998, 38 (10-11): : 1221 - 1239
  • [8] Radius Degree Layout - Fast and Easy Graph Visualization Layout
    Takac, Lubos
    Zabovsky, Michal
    2014 10TH INTERNATIONAL CONFERENCE ON DIGITAL TECHNOLOGIES (DT), 2014, : 338 - 343
  • [9] Optimal Graph Constraint Reduction for Symbolic Layout Compaction
    Pan, Peichen
    Dong, Sai-Keung
    Liu, C.L.
    Algorithmica (New York), 1997, 18 (04): : 560 - 574
  • [10] Optimal Graph Constraint Reduction for Symbolic Layout Compaction
    Peichen Pan
    Sai-keung Dong
    C. L. Liu
    Algorithmica, 1997, 18 : 560 - 574