Multi-Level Area Balancing of Clustered Graphs

被引:7
作者
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
相关论文
共 70 条
  • [1] Design Study of LineSets, a Novel Set Visualization Technique
    Alper, Basak
    Riche, Nathalie Henry
    Ramos, Gonzalo
    Czerwinski, Mary
    [J]. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2011, 17 (12) : 2259 - 2267
  • [2] [Anonymous], 2019, BOOST C LIB VERSION
  • [3] [Anonymous], 2019, The Computational Geometry Algorithms Library
  • [4] [Anonymous], 2013, Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, DOI DOI 10.1145/2470654.2466444
  • [5] [Anonymous], 2019, GRAPH DRAWING CONTES
  • [6] [Anonymous], 2017, QT 5 8 CROSS PLATFOR
  • [7] [Anonymous], 2018, Eigen-a C++ template library for linear algebra: matrices, vectors, numerical solvers, and related algorithms
  • [8] Auer S., 2018, P 8 INT C WEB INT MI, P1, DOI [DOI 10.1145/3227609.3227689, 10.1145/3227609.3227689]
  • [9] Voronoi treemaps
    Balzer, M
    Deussen, O
    [J]. INFOVIS 05: IEEE SYMPOSIUM ON INFORMATION VISUALIZATION, PROCEEDINGS, 2005, : 49 - 56
  • [10] Bertault F, 1999, LECT NOTES COMPUT SC, V1731, P197