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 条
  • [41] Fast Algorithm for Anchor Graph Hashing
    Fujiwara, Yasuhiro
    Kanai, Sekitoshi
    Ida, Yasutoshi
    Kumagai, Atsutoshi
    Ueda, Naonori
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2021, 14 (06): : 916 - 928
  • [42] Fast layout segmentation algorithm based on sparsity difference
    Lin, Lan
    Zhang, Rubo
    Zhao, Ge
    Liu, Guanqun
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2015, 43 : 533 - 535
  • [43] COMPOUND DYNAMIC CONSTRAINT OF STOCHASTIC OPTIMIZATION MODEL AND ALGORITHM
    Zhou, Lei
    Li, Fa-Chao
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON WAVELET ANALYSIS AND PATTERN RECOGNITION, VOLS 1 AND 2, 2008, : 783 - 787
  • [44] iClaire: A Fast and General Layout Pattern Classification Algorithm
    Chang, Wei-Chun
    Jiang, Iris Hui-Ru
    Yu, Yen-Ting
    Liu, Wei-Fang
    PROCEEDINGS OF THE 2017 54TH ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2017,
  • [45] Time complexity analyses on fast grid layout algorithm
    He, Sheng
    Pan, Yu
    Zhou, Quanfa
    Zhou, Bing
    Chen, Dan
    Liang, Guobin
    SMART MATERIALS AND INTELLIGENT SYSTEMS, 2012, 442 : 436 - +
  • [46] Photo Layout with a Fast Evaluation Method and Genetic Algorithm
    Fan, Jian
    2012 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO WORKSHOPS (ICMEW), 2012, : 308 - 313
  • [47] A near-optimum parallel algorithm for a graph layout problem
    Wang, RL
    Xu, XS
    Tang, Z
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (02) : 495 - 501
  • [48] An O(N) sorting algorithm for IC layout graph operation
    Li, G
    Lin, ZH
    Chen, HP
    PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN & COMPUTER GRAPHICS, 1999, : 639 - 642
  • [49] A VLSI layout legalization technique based on a graph fixing algorithm
    Wu, S. D.
    Tsai, Chun-Chi
    Yang, Michael
    2006 INTERNATIONAL SYMPOSIUM ON VLSI DESIGN, AUTOMATION, AND TEST (VLSI-DAT), PROCEEDINGS OF TECHNICAL PAPERS, 2006, : 155 - +
  • [50] A subspace constraint based approach for fast hierarchical graph embedding
    Minghe Yu
    Xu Chen
    Xinhao Gu
    Hengyu Liu
    Lun Du
    World Wide Web, 2023, 26 : 3691 - 3705