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 条
  • [21] Ant Colony Algorithm for Flexible Graph Layout
    Zhou, Yuncai
    NFD 2010: INTERNATIONAL CONFERENCE ON NETWORK AND FINANCE DEVELOPMENT, 2010, : 155 - 158
  • [22] Extending the Integrity Constraint Support in a Graph Database
    Reina, Fabio
    Huf, Alexis
    Presser, Daniel
    Siqueira, Frank
    IEEE LATIN AMERICA TRANSACTIONS, 2021, 19 (04) : 604 - 611
  • [23] A fast algorithm for mining closed itemsets under the length-decreasing support constraint
    Zang, Liangjun
    Wang, Li
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 6059 - 6063
  • [24] A fast layout algorithm for visual video summaries
    Girgensohn, A
    2003 INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, VOL II, PROCEEDINGS, 2003, : 77 - 80
  • [25] A fast layout algorithm for protein interaction networks
    Han, K
    Ju, BH
    BIOINFORMATICS, 2003, 19 (15) : 1882 - 1888
  • [26] An improved graph layout algorithm of embedded node attributes
    Tang, Ying
    Wang, Bin
    Fan, Jing
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2016, 28 (02): : 228 - 237
  • [27] BioLayout - an automatic graph layout algorithm for similarity visualization
    Enright, AJ
    Ouzounis, CA
    BIOINFORMATICS, 2001, 17 (09) : 853 - 854
  • [28] Neural-network algorithm for a graph layout problem
    Montana State Univ, Bozeman, United States
    IEEE Trans Neural Networks, 2 (341-345):
  • [29] A neural-network algorithm for a graph layout problem
    Cimikowski, R
    Shope, P
    IEEE TRANSACTIONS ON NEURAL NETWORKS, 1996, 7 (02): : 341 - 345
  • [30] Shock Wave: a Graph Layout Algorithm for Text Analyzing
    Cauz, Maxime
    Albert, Julien
    Wallemacq, Anne
    Linden, Isabelle
    Dumas, Bruno
    PROCEEDINGS OF THE 21ST ACM SYMPOSIUM ON DOCUMENT ENGINEERING (DOCENG '21), 2021,