LinSets.zip: Compressing Linear Set Diagrams

被引:3
作者
Wallinger, Markus [1 ]
Dobler, Alexander [1 ]
Noellenburg, Martin [1 ]
机构
[1] TU Wien, Algorithms & Complex Grp, A-1040 Vienna, Austria
关键词
Task analysis; Visualization; Data visualization; Image color analysis; Heuristic algorithms; Taxonomy; Sparse matrices; Computational experiment; linear diagrams; set visualization; user evaluation; VISUALIZATION;
D O I
10.1109/TVCG.2023.3261934
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Linear diagrams are used to visualize set systems by depicting set memberships as horizontal line segments in a matrix, where each set is represented as a row and each element as a column. Each such line segment of a set is shown in a contiguous horizontal range of cells of the matrix indicating that the corresponding elements in the columns belong to the set. As each set occupies its own row in the matrix, the total height of the resulting visualization is as large as the number of sets in the instance. Such a linear diagram can be visually sparse and intersecting sets containing the same element might be represented by distant rows. To alleviate such undesirable effects, we present LinSets.zip, a new approach that achieves a more space-efficient representation of linear diagrams. First, we minimize the total number of gaps in the horizontal segments by reordering columns, a criterion that has been shown to increase readability in linear diagrams. The main difference of LinSets.zip to linear diagrams is that multiple non-intersecting sets can be positioned in the same row of the matrix. Furthermore, we present several different rendering variations for a matrix-based representation that utilize the proposed row compression. We implemented the different steps of our approach in a visualization pipeline using integer-linear programming, and suitable heuristics aiming at sufficiently fast computations in practice. We conducted both a quantitative evaluation and a small-scale user experiment to compare the effects of compressing linear diagrams.
引用
收藏
页码:2875 / 2887
页数:13
相关论文
共 33 条
[1]   The Perception of Clutter in Linear Diagrams [J].
Alqadah, Mohanad ;
Stapleton, Gem ;
Howse, John ;
Chapman, Peter .
DIAGRAMMATIC REPRESENTATION AND INFERENCE, DIAGRAMS 2016, 2016, 9781 :250-257
[2]   The State-of-the-Art of Set Visualization [J].
Alsallakh, Bilal ;
Micallef, Luana ;
Aigner, Wolfgang ;
Hauser, Helwig ;
Miksch, Silvia ;
Rodgers, Peter .
COMPUTER GRAPHICS FORUM, 2016, 35 (01) :234-260
[3]   Radial Sets: Interactive Visual Analysis of Large Overlapping Sets [J].
Alsallakh, Bilal ;
Aigner, Wolfgang ;
Miksch, Silvia ;
Hauser, Helwig .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2013, 19 (12) :2496-2505
[4]   Generating Effective Euler Diagrams [J].
Baimagambetov, Almas ;
Howse, John ;
Stapleton, Gem ;
Delaney, Aidan .
DIAGRAMMATIC REPRESENTATION AND INFERENCE, DIAGRAMS 2018, 2018, 10871 :39-54
[5]   APPROXIMATING MAXIMUM INDEPENDENT SETS BY EXCLUDING SUBGRAPHS [J].
BOPPANA, R ;
HALLDORSSON, MM .
BIT, 1992, 32 (02) :180-196
[6]   NEW METHODS TO COLOR THE VERTICES OF A GRAPH [J].
BRELAZ, D .
COMMUNICATIONS OF THE ACM, 1979, 22 (04) :251-256
[7]  
Chapman P., 2021, TALK ABSTR DIAGRAMS, P1
[8]   Minimising line segments in linear diagrams is NP-hard [J].
Chapman, Peter ;
Sim, Kevin ;
Chen, Huang Hao .
JOURNAL OF COMPUTER LANGUAGES, 2022, 71
[9]   Interactivity in Linear Diagrams [J].
Chapman, Peter .
DIAGRAMMATIC REPRESENTATION AND INFERENCE, DIAGRAMS 2021, 2021, 12909 :449-465
[10]  
Chapman P, 2014, LECT NOTES COMPUT SC, V8578, P146, DOI 10.1007/978-3-662-44043-8_18