EulerMerge: Simplifying Euler Diagrams Through Set Merges

被引:0
作者
Yan, Xinyuan [1 ]
Rodgers, Peter [2 ]
Rottmann, Peter [3 ]
Archambault, Daniel [4 ]
Haunert, Jan-Henrik [3 ]
Wang, Bei [1 ]
机构
[1] Univ Utah, Salt Lake City, UT 84112 USA
[2] Univ Kent, Canterbury, Kent, England
[3] Univ Bonn, Bonn, Germany
[4] Newcastle Univ, Newcastle Upon Tyne, Tyne & Wear, England
来源
DIAGRAMMATIC REPRESENTATION AND INFERENCE, DIAGRAMS 2024 | 2024年 / 14981卷
关键词
Euler diagrams; Set visualization; Hypergraph visualization; Scalability;
D O I
10.1007/978-3-031-71291-3_16
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Euler diagrams are an intuitive and popular method to visualize set-based data. In an Euler diagram, each set is represented as a closed curve, and set intersections are shown by curve overlaps. However, Euler diagrams are not visually scalable and automatic layout techniques struggle to display real-world data sets in a comprehensible way. Prior state-of-the-art approaches can embed Euler diagrams by splitting a closed curve into multiple curves so that a set is represented by multiple disconnected enclosed areas. In addition, these methods typically result in multiple curve segments being drawn concurrently. Both of these features significantly impede understanding. In this paper, we present a new and scalable method for embedding Euler diagrams using set merges. Our approach simplifies the underlying data to ensure that each set is represented by a single, connected enclosed area and that the diagram is drawn without curve concurrency, leading to wellformed and understandable Euler diagrams.
引用
收藏
页码:190 / 206
页数:17
相关论文
共 45 条
[21]   Euler-type Diagrams and the Quantification of the Predicate [J].
Lemanski, Jens .
JOURNAL OF PHILOSOPHICAL LOGIC, 2020, 49 (02) :401-416
[22]   Using Euler Diagrams in Traditional Library Environments [J].
Thievre, Jerome ;
Viaud, Marie-Luce ;
Verroust-Blondet, Anne .
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 134 :189-202
[23]   A Simple Approach for Boundary Improvement of Euler Diagrams [J].
Simonetto, Paolo ;
Archambault, Daniel ;
Scheidegger, Carlos .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2016, 22 (01) :678-687
[24]   Wellformedness Properties in Euler Diagrams: Which Should Be Used? [J].
Rodgers, Peter ;
Zhang, Leishi ;
Purchase, Helen .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2012, 18 (07) :1089-1100
[25]   On the drawability of 3D Venn and Euler diagrams [J].
Flower, Jean ;
Stapleton, Gem ;
Rodgers, Peter .
JOURNAL OF VISUAL LANGUAGES AND COMPUTING, 2014, 25 (03) :186-209
[26]   Hoop Diagrams: A Set Visualization Method [J].
Rodgers, Peter ;
Chapman, Peter ;
Blake, Andrew ;
Nollenburg, Martin ;
Wallinger, Markus ;
Dobler, Alexander .
DIAGRAMMATIC REPRESENTATION AND INFERENCE, DIAGRAMS 2024, 2024, 14981 :377-392
[27]   Euler diagrams drawn with ellipses area-proportionally (Edeap) [J].
Wybrow, Michael ;
Rodgers, Peter ;
Dib, Fadi K. .
BMC BIOINFORMATICS, 2021, 22 (01)
[28]   Proof Theory for Reasoning with Euler Diagrams: A Logic Translation and Normalization [J].
Takemura, Ryo .
STUDIA LOGICA, 2013, 101 (01) :157-191
[29]   Small multiples Euler-time diagrams for software engineering [J].
Sathiyanarayanan M. ;
Alsaffar M. .
Innovations in Systems and Software Engineering, 2017, 13 (4) :299-307
[30]   Online region computations for Euler diagrams with relaxed drawing conventions [J].
Cordasco, Gennaro ;
De Chiara, Rosario ;
Fish, Andrew .
JOURNAL OF VISUAL LANGUAGES AND COMPUTING, 2017, 38 :18-37