SP EULER : Semantics-preserving Euler Diagrams

dc.contributor.authorKehlbeck, Rebecca
dc.contributor.authorGörtler, Jochen
dc.contributor.authorWang, Yunhai
dc.contributor.authorDeussen, Oliver
dc.date.accessioned2021-10-14T08:40:49Z
dc.date.available2021-10-14T08:40:49Z
dc.date.issued2022-01
dc.description.abstractCreating 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.eng
dc.description.versionpublishedeng
dc.identifier.doi10.1109/TVCG.2021.3114834eng
dc.identifier.pmid34587064eng
dc.identifier.urihttps://kops.uni-konstanz.de/handle/123456789/55249
dc.language.isoengeng
dc.rightsterms-of-use
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/
dc.subjectEuler diagrams, Venn diagrams, set visualization, layout algorithmeng
dc.subject.ddc004eng
dc.titleSP EULER : Semantics-preserving Euler Diagramseng
dc.typeJOURNAL_ARTICLEeng
dspace.entity.typePublication
kops.citation.bibtex
@article{Kehlbeck2022-01EULER-55249,
  year={2022},
  doi={10.1109/TVCG.2021.3114834},
  title={SP EULER : Semantics-preserving Euler Diagrams},
  number={1},
  volume={28},
  issn={1077-2626},
  journal={IEEE Transactions on Visualization and Computer Graphics},
  pages={433--442},
  author={Kehlbeck, Rebecca and Görtler, Jochen and Wang, Yunhai and Deussen, Oliver}
}
kops.citation.iso690KEHLBECK, Rebecca, Jochen GÖRTLER, Yunhai WANG, Oliver DEUSSEN, 2022. SP EULER : Semantics-preserving Euler Diagrams. In: IEEE Transactions on Visualization and Computer Graphics. IEEE. 2022, 28(1), pp. 433-442. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2021.3114834deu
kops.citation.iso690KEHLBECK, Rebecca, Jochen GÖRTLER, Yunhai WANG, Oliver DEUSSEN, 2022. SP EULER : Semantics-preserving Euler Diagrams. In: IEEE Transactions on Visualization and Computer Graphics. IEEE. 2022, 28(1), pp. 433-442. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2021.3114834eng
kops.citation.rdf
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/55249">
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/55249"/>
    <dc:creator>Kehlbeck, Rebecca</dc:creator>
    <dc:contributor>Wang, Yunhai</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-10-14T08:40:49Z</dc:date>
    <dcterms:title>SP EULER : Semantics-preserving Euler Diagrams</dcterms:title>
    <dcterms:abstract xml:lang="eng">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.</dcterms:abstract>
    <dc:rights>terms-of-use</dc:rights>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:language>eng</dc:language>
    <dc:creator>Görtler, Jochen</dc:creator>
    <dc:contributor>Deussen, Oliver</dc:contributor>
    <dc:contributor>Görtler, Jochen</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-10-14T08:40:49Z</dcterms:available>
    <dc:creator>Deussen, Oliver</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Kehlbeck, Rebecca</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:issued>2022-01</dcterms:issued>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:creator>Wang, Yunhai</dc:creator>
  </rdf:Description>
</rdf:RDF>
kops.flag.isPeerReviewedtrueeng
kops.flag.knbibliographytrue
kops.sourcefieldIEEE Transactions on Visualization and Computer Graphics. IEEE. 2022, <b>28</b>(1), pp. 433-442. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2021.3114834deu
kops.sourcefield.plainIEEE Transactions on Visualization and Computer Graphics. IEEE. 2022, 28(1), pp. 433-442. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2021.3114834deu
kops.sourcefield.plainIEEE Transactions on Visualization and Computer Graphics. IEEE. 2022, 28(1), pp. 433-442. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2021.3114834eng
relation.isAuthorOfPublicationfd0fc6fa-e2c2-40e1-ab80-b8cd937de618
relation.isAuthorOfPublicationf784006c-9225-4a70-aab1-672a7ba97b9d
relation.isAuthorOfPublication4e85f041-bb89-4e27-b7d6-acd814feacb8
relation.isAuthorOfPublication.latestForDiscoveryfd0fc6fa-e2c2-40e1-ab80-b8cd937de618
source.bibliographicInfo.fromPage433
source.bibliographicInfo.issue1
source.bibliographicInfo.toPage442
source.bibliographicInfo.volume28
source.identifier.eissn1941-0506eng
source.identifier.issn1077-2626eng
source.periodicalTitleIEEE Transactions on Visualization and Computer Graphicseng
source.publisherIEEEeng

Dateien