Multi-Level Area Balancing of Clustered Graphs

被引:6
|
作者
Wu, Hsiang-Yun [1 ]
Nollenburg, Martin [1 ]
Viola, Ivan [2 ]
机构
[1] TU Wien, A-1040 Vienna, Austria
[2] King Abdullah Univ Sci & Technol KAUST, Thuwal 23955, Saudi Arabia
基金
奥地利科学基金会;
关键词
Layout; Visualization; Clustering algorithms; Data visualization; Shape; Partitioning algorithms; Chemical elements; Graph drawing; Voronoi tessellation; multi-level; spatially-efficient layout; OF-THE-ART; VISUALIZING GRAPHS; ALGORITHM; DESIGN; LAYOUT; MAPS;
D O I
10.1109/TVCG.2020.3038154
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present a multi-level area balancing technique for laying out clustered graphs to facilitate a comprehensive understanding of the complex relationships that exist in various fields, such as life sciences and sociology. Clustered graphs are often used to model relationships that are accompanied by attribute-based grouping information. Such information is essential for robust data analysis, such as for the study of biological taxonomies or educational backgrounds. Hence, the ability to smartly arrange textual labels and packing graphs within a certain screen space is therefore desired to successfully convey the attribute data . Here we propose to hierarchically partition the input screen space using Voronoi tessellations in multiple levels of detail. In our method, the position of textual labels is guided by the blending of constrained forces and the forces derived from centroidal Voronoi cells. The proposed algorithm considers three main factors: (1) area balancing, (2) schematized space partitioning, and (3) hairball management. We primarily focus on area balancing, which aims to allocate a uniform area for each textual label in the diagram. We achieve this by first untangling a general graph to a clustered graph through textual label duplication, and then coupling with spanning-tree-like visual integration. We illustrate the feasibility of our approach with examples and then evaluate our method by comparing it with well-known conventional approaches and collecting feedback from domain experts.
引用
收藏
页码:2682 / 2696
页数:15
相关论文
共 50 条
  • [1] Multi-level exploration of citation graphs
    Boutin, F
    Hascoët, M
    RESEARCH AND ADVANCED TECHNOLOGY FOR DIGITAL LIBRARIES, 2004, 3232 : 366 - 377
  • [2] Multi-level distance labelings for helm graphs
    Rahim, M. Tariq
    Tomescu, Ioan
    ARS COMBINATORIA, 2012, 104 : 513 - 523
  • [3] MULTI-LEVEL LOAD BALANCING FOR PARALLEL PARTICLE SIMULATIONS
    Sutmann, Godehard
    VI INTERNATIONAL CONFERENCE ON PARTICLE-BASED METHODS (PARTICLES 2019): FUNDAMENTALS AND APPLICATIONS, 2019, : 80 - 92
  • [4] Integration of multi-level postural balancing on humanoid robots
    Hyon, Sang-Ho
    Osu, Rieko
    Otaka, Yohei
    ICRA: 2009 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-7, 2009, : 1607 - +
  • [6] Multi-level Load Balancing with an Integrated Runtime Approach
    Bak, Seonmyeong
    Menon, Harshitha
    White, Sam
    Diener, Matthias
    Kale, Laxmikant
    2018 18TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID), 2018, : 31 - 40
  • [7] Condensed graphs: A multi-level, parallel, abstract machine
    Morrison, JP
    Dalton, NJ
    HIGH PERFORMANCE COMPUTING SYSTEMS AND APPLICATIONS, 2000, 541 : 237 - 252
  • [8] Condensed graphs: A multi-level, parallel, intermediate representation
    Morrison, JP
    Dalton, NJ
    EURO-PAR'99: PARALLEL PROCESSING, 1999, 1685 : 866 - 876
  • [9] Dynamic Multi-level Overlay Graphs for Shortest Paths
    Bruera, Francesco
    Cicerone, Serafino
    D'Angelo, Gianlorenzo
    Di Stefano, Gabriele
    Frigioni, Daniele
    MATHEMATICS IN COMPUTER SCIENCE, 2008, 1 (04) : 709 - 736
  • [10] Multi-level Disentangled Contrastive Learning on Heterogeneous Graphs
    Lin, Tong
    Zhou, Cangqi
    Li, Qianmu
    Hu, Dianming
    2024 16TH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND COMPUTING, ICMLC 2024, 2024, : 628 - 634