Inductively Generating Euler Diagrams

Cite This

Files in this item

Checksum: MD5:9c57a795ca16be6032a9fea4f1e6778f

STAPLETON, Gem, Peter RODGERS, John HOWSE, Leishi ZHANG, 2011. Inductively Generating Euler Diagrams. In: IEEE Transactions on Visualization and Computer Graphics. 17(1), pp. 88-100. Available under: doi: 10.1109/TVCG.2010.28

@article{Stapleton2011Induc-6448, title={Inductively Generating Euler Diagrams}, year={2011}, doi={10.1109/TVCG.2010.28}, number={1}, volume={17}, journal={IEEE Transactions on Visualization and Computer Graphics}, pages={88--100}, author={Stapleton, Gem and Rodgers, Peter and Howse, John and Zhang, Leishi} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:creator>Howse, John</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:abstract xml:lang="eng">Euler diagrams have a wide variety of uses, from information visualization to logical asoning. In all of their application areas, the ability to automatically layout Euler diagrams brings considerable benefits. In this paper, we present a novel approach to Euler diagram generation. We develop certain graphs associated with Euler diagrams in order to allow curves to be added by finding cycles in these graphs. This permits us to build Euler diagrams inductively, adding one curve at a time. Our technique is adaptable, allowing the easy specification, and enforcement, of sets of well-formedness conditions; we present a series of results that identify properties of cycles that correspond to the well-formedness conditions. This improves upon other contributions toward the automated generation of Euler diagrams which implicitly assume some fixed set of well-formedness conditions must hold. In addition, unlike most of these other generation methods, our technique allows any abstract description to be drawn as an Euler diagram. To establish the utility of the approach, a prototype implementation has been developed</dcterms:abstract> <dspace:hasBitstream rdf:resource=""/> <dc:creator>Rodgers, Peter</dc:creator> <dc:contributor>Zhang, Leishi</dc:contributor> <dcterms:hasPart rdf:resource=""/> <dc:language>deu</dc:language> <dc:date rdf:datatype="">2011-03-24T16:12:47Z</dc:date> <dc:rights>terms-of-use</dc:rights> <dcterms:issued>2011</dcterms:issued> <dcterms:isPartOf rdf:resource=""/> <dcterms:bibliographicCitation>First publ. in: IEEE Transactions on Visualization and Computer Graphics ; 17 (2011), 1. - S. 88-100</dcterms:bibliographicCitation> <dspace:isPartOfCollection rdf:resource=""/> <dc:creator>Zhang, Leishi</dc:creator> <dcterms:rights rdf:resource=""/> <dcterms:title>Inductively Generating Euler Diagrams</dcterms:title> <dc:creator>Stapleton, Gem</dc:creator> <dc:contributor>Rodgers, Peter</dc:contributor> <dc:contributor>Howse, John</dc:contributor> <dcterms:available rdf:datatype="">2011-03-24T16:12:47Z</dcterms:available> <dc:contributor>Stapleton, Gem</dc:contributor> <dc:format>application/pdf</dc:format> <bibo:uri rdf:resource=""/> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

keim.pdf 431

This item appears in the following Collection(s)

Search KOPS


My Account