Drawing Euler diagrams with circles : the theory of piercings

dc.contributor.authorStapleton, Gemdeu
dc.contributor.authorZhang, Leishi
dc.contributor.authorHowse, Johndeu
dc.contributor.authorRodgers, Peterdeu
dc.date.accessioned2012-03-20T20:35:47Zdeu
dc.date.available2012-03-20T20:35:47Zdeu
dc.date.issued2010-09-08
dc.description.abstractEuler diagrams are effective tools for visualizing set intersections. They have a large number of application areas ranging from statistical data analysis to software engineering. However, the automated generation of Euler diagrams has never been easy: given an abstract description of a required Euler diagram, it is computationally expensive to generate the diagram. Moreover, the generated diagrams represent sets by polygons, sometimes with quite irregular shapes that make the diagrams less comprehensible. In this paper, we address these two issues by developing the theory of piercings, where we define single piercing curves and double piercing curves. We prove that if a diagram can be built inductively by successively adding piercing curves under certain constraints, then it can be drawn with circles, which are more esthetically pleasing than arbitrary polygons. The theory of piercings is developed at the abstract level. In addition, we present a Java implementation that, given an inductively pierced abstract description, generates an Euler diagram consisting only of circles within polynomial time.eng
dc.description.versionpublished
dc.identifier.citationFirst publ. in: IEEE Transactions on Visualization and Computer Graphics (TVCG) ; 17 (2011), 7. - pp. 1020-1032deu
dc.identifier.doi10.1109/TVCG.2010.119deu
dc.identifier.pmid20855916
dc.identifier.ppn362215944deu
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/18812
dc.language.isoengdeu
dc.legacy.dateIssued2012-03-20deu
dc.rightsterms-of-usedeu
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/deu
dc.subjectAutomated diagram drawingdeu
dc.subjectEuler diagramsdeu
dc.subjectdiagrammatic reasoningdeu
dc.subjectinformation visualizationdeu
dc.subject.ddc004deu
dc.titleDrawing Euler diagrams with circles : the theory of piercingseng
dc.typeJOURNAL_ARTICLEdeu
dspace.entity.typePublication
kops.citation.bibtex
@article{Stapleton2010-09-08Drawi-18812,
  year={2010},
  doi={10.1109/TVCG.2010.119},
  title={Drawing Euler diagrams with circles : the theory of piercings},
  number={7},
  volume={17},
  issn={1077-2626},
  journal={IEEE Transactions on Visualization and Computer Graphics},
  pages={1020--1032},
  author={Stapleton, Gem and Zhang, Leishi and Howse, John and Rodgers, Peter}
}
kops.citation.iso690STAPLETON, Gem, Leishi ZHANG, John HOWSE, Peter RODGERS, 2010. Drawing Euler diagrams with circles : the theory of piercings. In: IEEE Transactions on Visualization and Computer Graphics. 2010, 17(7), pp. 1020-1032. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2010.119deu
kops.citation.iso690STAPLETON, Gem, Leishi ZHANG, John HOWSE, Peter RODGERS, 2010. Drawing Euler diagrams with circles : the theory of piercings. In: IEEE Transactions on Visualization and Computer Graphics. 2010, 17(7), pp. 1020-1032. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2010.119eng
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/18812">
    <dc:creator>Stapleton, Gem</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/18812"/>
    <dcterms:bibliographicCitation>First publ. in: IEEE Transactions on Visualization and Computer Graphics (TVCG) ; 17 (2011), 7. - pp. 1020-1032</dcterms:bibliographicCitation>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Howse, John</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/18812/2/stapleton_drawing%20euler.pdf"/>
    <dc:creator>Rodgers, Peter</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-03-20T20:35:47Z</dcterms:available>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-03-20T20:35:47Z</dc:date>
    <dcterms:title>Drawing Euler diagrams with circles : the theory of piercings</dcterms:title>
    <dcterms:issued>2010-09-08</dcterms:issued>
    <dc:contributor>Rodgers, Peter</dc:contributor>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/18812/2/stapleton_drawing%20euler.pdf"/>
    <dc:contributor>Stapleton, Gem</dc:contributor>
    <dc:creator>Howse, John</dc:creator>
    <dcterms:abstract xml:lang="eng">Euler diagrams are effective tools for visualizing set intersections. They have a large number of application areas ranging from statistical data analysis to software engineering. However, the automated generation of Euler diagrams has never been easy: given an abstract description of a required Euler diagram, it is computationally expensive to generate the diagram. Moreover, the generated diagrams represent sets by polygons, sometimes with quite irregular shapes that make the diagrams less comprehensible. In this paper, we address these two issues by developing the theory of piercings, where we define single piercing curves and double piercing curves. We prove that if a diagram can be built inductively by successively adding piercing curves under certain constraints, then it can be drawn with circles, which are more esthetically pleasing than arbitrary polygons. The theory of piercings is developed at the abstract level. In addition, we present a Java implementation that, given an inductively pierced abstract description, generates an Euler diagram consisting only of circles within polynomial time.</dcterms:abstract>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:creator>Zhang, Leishi</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Zhang, Leishi</dc:contributor>
  </rdf:Description>
</rdf:RDF>
kops.description.openAccessopenaccessgreen
kops.flag.knbibliographytrue
kops.identifier.nbnurn:nbn:de:bsz:352-188122deu
kops.sourcefieldIEEE Transactions on Visualization and Computer Graphics. 2010, <b>17</b>(7), pp. 1020-1032. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2010.119deu
kops.sourcefield.plainIEEE Transactions on Visualization and Computer Graphics. 2010, 17(7), pp. 1020-1032. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2010.119deu
kops.sourcefield.plainIEEE Transactions on Visualization and Computer Graphics. 2010, 17(7), pp. 1020-1032. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2010.119eng
kops.submitter.emailoleg.kozlov@uni-konstanz.dedeu
relation.isAuthorOfPublication5e783bd4-d864-456a-9bf4-62fd352bda98
relation.isAuthorOfPublication.latestForDiscovery5e783bd4-d864-456a-9bf4-62fd352bda98
source.bibliographicInfo.fromPage1020
source.bibliographicInfo.issue7
source.bibliographicInfo.toPage1032
source.bibliographicInfo.volume17
source.identifier.eissn1941-0506
source.identifier.issn1077-2626
source.periodicalTitleIEEE Transactions on Visualization and Computer Graphics

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
stapleton_drawing euler.pdf
Größe:
10.12 MB
Format:
Adobe Portable Document Format
stapleton_drawing euler.pdf
stapleton_drawing euler.pdfGröße: 10.12 MBDownloads: 640

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
license.txt
Größe:
1.92 KB
Format:
Plain Text
Beschreibung:
license.txt
license.txtGröße: 1.92 KBDownloads: 0