Exploring the limits of complexity : A survey of empirical studies on graph visualisation
Exploring the limits of complexity : A survey of empirical studies on graph visualisation
Loading...
Date
2018
Authors
Yoghourdjian, Vahan
Archambault, Daniel
Diehl, Stephan
Dwyer, Tim
Purchase, Helen C.
Wu, Hsiang-Yun
Editors
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
DOI (citable link)
International patent number
Link to the license
EU project number
Project
Open Access publication
Collections
Title in another language
Publication type
Journal article
Publication status
Published
Published in
Visual Informatics ; 2 (2018), 4. - pp. 264-282. - ISSN 2468-502X. - eISSN 2468-502X
Abstract
For decades, researchers in information visualisation and graph drawing have focused on developing techniques for the layout and display of very large and complex networks. Experiments involving human participants have also explored the readability of different styles of layout and representations for such networks. In both bodies of literature, networks are frequently referred to as being ‘large’ or ‘complex’, yet these terms are relative. From a human-centred, experiment point-of-view, what constitutes ‘large’ (for example) depends on several factors, such as data complexity, visual complexity, and the technology used. In this paper, we survey the literature on human-centred experiments to understand how, in practice, different features and characteristics of node–link diagrams affect visual complexity.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Graph visualisation; Network; visualisation node–link diagrams; Cognitive scalability; Evaluations; Empirical studies
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690
YOGHOURDJIAN, Vahan, Daniel ARCHAMBAULT, Stephan DIEHL, Tim DWYER, Karsten KLEIN, Helen C. PURCHASE, Hsiang-Yun WU, 2018. Exploring the limits of complexity : A survey of empirical studies on graph visualisation. In: Visual Informatics. 2(4), pp. 264-282. ISSN 2468-502X. eISSN 2468-502X. Available under: doi: 10.1016/j.visinf.2018.12.006BibTex
@article{Yoghourdjian2018-12Explo-44693, year={2018}, doi={10.1016/j.visinf.2018.12.006}, title={Exploring the limits of complexity : A survey of empirical studies on graph visualisation}, number={4}, volume={2}, issn={2468-502X}, journal={Visual Informatics}, pages={264--282}, author={Yoghourdjian, Vahan and Archambault, Daniel and Diehl, Stephan and Dwyer, Tim and Klein, Karsten and Purchase, Helen C. and Wu, Hsiang-Yun} }
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/44693"> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-23T13:35:18Z</dcterms:available> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44693"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-23T13:35:18Z</dc:date> <dc:rights>Attribution-NonCommercial-NoDerivatives 4.0 International</dc:rights> <dc:contributor>Dwyer, Tim</dc:contributor> <dc:creator>Archambault, Daniel</dc:creator> <dc:contributor>Wu, Hsiang-Yun</dc:contributor> <dc:creator>Yoghourdjian, Vahan</dc:creator> <dc:creator>Purchase, Helen C.</dc:creator> <dc:contributor>Purchase, Helen C.</dc:contributor> <dcterms:issued>2018-12</dcterms:issued> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:creator>Wu, Hsiang-Yun</dc:creator> <dc:contributor>Klein, Karsten</dc:contributor> <dcterms:title>Exploring the limits of complexity : A survey of empirical studies on graph visualisation</dcterms:title> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:creator>Dwyer, Tim</dc:creator> <dcterms:abstract xml:lang="eng">For decades, researchers in information visualisation and graph drawing have focused on developing techniques for the layout and display of very large and complex networks. Experiments involving human participants have also explored the readability of different styles of layout and representations for such networks. In both bodies of literature, networks are frequently referred to as being ‘large’ or ‘complex’, yet these terms are relative. From a human-centred, experiment point-of-view, what constitutes ‘large’ (for example) depends on several factors, such as data complexity, visual complexity, and the technology used. In this paper, we survey the literature on human-centred experiments to understand how, in practice, different features and characteristics of node–link diagrams affect visual complexity.</dcterms:abstract> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/4.0/"/> <dc:contributor>Diehl, Stephan</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/44693/1/Yoghourdjian_2-dd2q27dtvz2x1.pdf"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/44693/1/Yoghourdjian_2-dd2q27dtvz2x1.pdf"/> <dc:contributor>Archambault, Daniel</dc:contributor> <dc:language>eng</dc:language> <dc:contributor>Yoghourdjian, Vahan</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Klein, Karsten</dc:creator> <dc:creator>Diehl, Stephan</dc:creator> </rdf:Description> </rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes
Refereed
Unknown