Loading…
SP E ULER : Semantics-preserving Euler Diagrams
Creating comprehensible visualizations of highly overlapping set-typed data is a challenging task due to its complexity. To facilitate insights into set connectivity and to leverage semantic relations between intersections, we propose a fast two-step layout technique for Euler diagrams that are both...
Saved in:
Published in: | IEEE transactions on visualization and computer graphics 2022-01, Vol.28 (1), p.433 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | |
container_issue | 1 |
container_start_page | 433 |
container_title | IEEE transactions on visualization and computer graphics |
container_volume | 28 |
creator | Kehlbeck, Rebecca Gortler, Jochen Wang, Yunhai Deussen, Oliver |
description | Creating comprehensible visualizations of highly overlapping set-typed data is a challenging task due to its complexity. To facilitate insights into set connectivity and to leverage semantic relations between intersections, we propose a fast two-step layout technique for Euler diagrams that are both well-matched and well-formed. Our method conforms to established form guidelines for Euler diagrams regarding semantics, aesthetics, and readability. First, we establish an initial ordering of the data, which we then use to incrementally create a planar, connected, and monotone dual graph representation. In the next step, the graph is transformed into a circular layout that maintains the semantics and yields simple Euler diagrams with smooth curves. When the data cannot be represented by simple diagrams, our algorithm always falls back to a solution that is not well-formed but still well-matched, whereas previous methods often fail to produce expected results. We show the usefulness of our method for visualizing set-typed data using examples from text analysis and infographics. Furthermore, we discuss the characteristics of our approach and evaluate our method against state-of-the-art methods. |
doi_str_mv | 10.1109/TVCG.2021.3114834 |
format | article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2613369603</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2613369603</sourcerecordid><originalsourceid>FETCH-proquest_journals_26133696033</originalsourceid><addsrcrecordid>eNqNi70OgjAURhujifjzAG5NnIF721rAFasODkbQlRBTCURAW_D5ZfABnL6TnPMRskLwECHy01t88Bgw9DiiCLkYEQcjgS5sQI4HhiBwmWRySmbWVgAoRBg5xE_OVNHrSV3olia6zpuuvFv3ZbTV5lM2BVX9Uxu6K_PC5LVdkMkjf1q9_O2crPcqjY_Do3332nZZ1famGVTGJHIuIwmc_1d9AV2iN_w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2613369603</pqid></control><display><type>article</type><title>SP E ULER : Semantics-preserving Euler Diagrams</title><source>IEEE Xplore (Online service)</source><creator>Kehlbeck, Rebecca ; Gortler, Jochen ; Wang, Yunhai ; Deussen, Oliver</creator><creatorcontrib>Kehlbeck, Rebecca ; Gortler, Jochen ; Wang, Yunhai ; Deussen, Oliver</creatorcontrib><description>Creating comprehensible visualizations of highly overlapping set-typed data is a challenging task due to its complexity. To facilitate insights into set connectivity and to leverage semantic relations between intersections, we propose a fast two-step layout technique for Euler diagrams that are both well-matched and well-formed. Our method conforms to established form guidelines for Euler diagrams regarding semantics, aesthetics, and readability. First, we establish an initial ordering of the data, which we then use to incrementally create a planar, connected, and monotone dual graph representation. In the next step, the graph is transformed into a circular layout that maintains the semantics and yields simple Euler diagrams with smooth curves. When the data cannot be represented by simple diagrams, our algorithm always falls back to a solution that is not well-formed but still well-matched, whereas previous methods often fail to produce expected results. We show the usefulness of our method for visualizing set-typed data using examples from text analysis and infographics. Furthermore, we discuss the characteristics of our approach and evaluate our method against state-of-the-art methods.</description><identifier>ISSN: 1077-2626</identifier><identifier>EISSN: 1941-0506</identifier><identifier>DOI: 10.1109/TVCG.2021.3114834</identifier><language>eng</language><publisher>New York: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</publisher><subject>Algorithms ; Data mining ; Graph representations ; Graphical representations ; Layouts ; Production methods ; Semantics</subject><ispartof>IEEE transactions on visualization and computer graphics, 2022-01, Vol.28 (1), p.433</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Kehlbeck, Rebecca</creatorcontrib><creatorcontrib>Gortler, Jochen</creatorcontrib><creatorcontrib>Wang, Yunhai</creatorcontrib><creatorcontrib>Deussen, Oliver</creatorcontrib><title>SP E ULER : Semantics-preserving Euler Diagrams</title><title>IEEE transactions on visualization and computer graphics</title><description>Creating comprehensible visualizations of highly overlapping set-typed data is a challenging task due to its complexity. To facilitate insights into set connectivity and to leverage semantic relations between intersections, we propose a fast two-step layout technique for Euler diagrams that are both well-matched and well-formed. Our method conforms to established form guidelines for Euler diagrams regarding semantics, aesthetics, and readability. First, we establish an initial ordering of the data, which we then use to incrementally create a planar, connected, and monotone dual graph representation. In the next step, the graph is transformed into a circular layout that maintains the semantics and yields simple Euler diagrams with smooth curves. When the data cannot be represented by simple diagrams, our algorithm always falls back to a solution that is not well-formed but still well-matched, whereas previous methods often fail to produce expected results. We show the usefulness of our method for visualizing set-typed data using examples from text analysis and infographics. Furthermore, we discuss the characteristics of our approach and evaluate our method against state-of-the-art methods.</description><subject>Algorithms</subject><subject>Data mining</subject><subject>Graph representations</subject><subject>Graphical representations</subject><subject>Layouts</subject><subject>Production methods</subject><subject>Semantics</subject><issn>1077-2626</issn><issn>1941-0506</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNqNi70OgjAURhujifjzAG5NnIF721rAFasODkbQlRBTCURAW_D5ZfABnL6TnPMRskLwECHy01t88Bgw9DiiCLkYEQcjgS5sQI4HhiBwmWRySmbWVgAoRBg5xE_OVNHrSV3olia6zpuuvFv3ZbTV5lM2BVX9Uxu6K_PC5LVdkMkjf1q9_O2crPcqjY_Do3332nZZ1famGVTGJHIuIwmc_1d9AV2iN_w</recordid><startdate>20220101</startdate><enddate>20220101</enddate><creator>Kehlbeck, Rebecca</creator><creator>Gortler, Jochen</creator><creator>Wang, Yunhai</creator><creator>Deussen, Oliver</creator><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20220101</creationdate><title>SP E ULER : Semantics-preserving Euler Diagrams</title><author>Kehlbeck, Rebecca ; Gortler, Jochen ; Wang, Yunhai ; Deussen, Oliver</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_26133696033</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Data mining</topic><topic>Graph representations</topic><topic>Graphical representations</topic><topic>Layouts</topic><topic>Production methods</topic><topic>Semantics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kehlbeck, Rebecca</creatorcontrib><creatorcontrib>Gortler, Jochen</creatorcontrib><creatorcontrib>Wang, Yunhai</creatorcontrib><creatorcontrib>Deussen, Oliver</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on visualization and computer graphics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kehlbeck, Rebecca</au><au>Gortler, Jochen</au><au>Wang, Yunhai</au><au>Deussen, Oliver</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>SP E ULER : Semantics-preserving Euler Diagrams</atitle><jtitle>IEEE transactions on visualization and computer graphics</jtitle><date>2022-01-01</date><risdate>2022</risdate><volume>28</volume><issue>1</issue><spage>433</spage><pages>433-</pages><issn>1077-2626</issn><eissn>1941-0506</eissn><abstract>Creating comprehensible visualizations of highly overlapping set-typed data is a challenging task due to its complexity. To facilitate insights into set connectivity and to leverage semantic relations between intersections, we propose a fast two-step layout technique for Euler diagrams that are both well-matched and well-formed. Our method conforms to established form guidelines for Euler diagrams regarding semantics, aesthetics, and readability. First, we establish an initial ordering of the data, which we then use to incrementally create a planar, connected, and monotone dual graph representation. In the next step, the graph is transformed into a circular layout that maintains the semantics and yields simple Euler diagrams with smooth curves. When the data cannot be represented by simple diagrams, our algorithm always falls back to a solution that is not well-formed but still well-matched, whereas previous methods often fail to produce expected results. We show the usefulness of our method for visualizing set-typed data using examples from text analysis and infographics. Furthermore, we discuss the characteristics of our approach and evaluate our method against state-of-the-art methods.</abstract><cop>New York</cop><pub>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</pub><doi>10.1109/TVCG.2021.3114834</doi></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1077-2626 |
ispartof | IEEE transactions on visualization and computer graphics, 2022-01, Vol.28 (1), p.433 |
issn | 1077-2626 1941-0506 |
language | eng |
recordid | cdi_proquest_journals_2613369603 |
source | IEEE Xplore (Online service) |
subjects | Algorithms Data mining Graph representations Graphical representations Layouts Production methods Semantics |
title | SP E ULER : Semantics-preserving Euler Diagrams |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T10%3A31%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=SP%20E%20ULER%20:%20Semantics-preserving%20Euler%20Diagrams&rft.jtitle=IEEE%20transactions%20on%20visualization%20and%20computer%20graphics&rft.au=Kehlbeck,%20Rebecca&rft.date=2022-01-01&rft.volume=28&rft.issue=1&rft.spage=433&rft.pages=433-&rft.issn=1077-2626&rft.eissn=1941-0506&rft_id=info:doi/10.1109/TVCG.2021.3114834&rft_dat=%3Cproquest%3E2613369603%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_26133696033%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2613369603&rft_id=info:pmid/&rfr_iscdi=true |