Publikation: Target Netgrams : An Annulus-Constrained Stress Model for Radial Graph Visualization
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
We present Target Netgrams as a visualization technique for radial layouts of graphs. Inspired by manually created target sociograms, we propose an annulus-constrained stress model that aims to position nodes onto the annuli between adjacent circles for indicating their radial hierarchy, while maintaining the network structure (clusters and neighborhoods) and improving readability as much as possible. This is achieved by having more space on the annuli than traditional layout techniques. By adapting stress majorization to this model, the layout is computed as a constrained least square optimization problem. Additional constraints (e.g., parent-child preservation, attribute-based clusters and structure-aware radii) are provided for exploring nodes, edges, and levels of interest. We demonstrate the effectiveness of our method through a comprehensive evaluation, a user study, and a case study.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
XUE, Mingliang, Yunhai WANG, Chang HAN, Jian ZHANG, Zheng WANG, Kaiyi ZHANG, Christophe HURTER, Jian ZHAO, Oliver DEUSSEN, 2022. Target Netgrams : An Annulus-Constrained Stress Model for Radial Graph Visualization. In: IEEE Transactions on Visualization and Computer Graphics. IEEE. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2022.3187425BibTex
@article{Xue2022-07-04Targe-57994, year={2022}, doi={10.1109/TVCG.2022.3187425}, title={Target Netgrams : An Annulus-Constrained Stress Model for Radial Graph Visualization}, issn={1077-2626}, journal={IEEE Transactions on Visualization and Computer Graphics}, author={Xue, Mingliang and Wang, Yunhai and Han, Chang and Zhang, Jian and Wang, Zheng and Zhang, Kaiyi and Hurter, Christophe and Zhao, Jian and Deussen, Oliver} }
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/57994"> <dc:creator>Zhang, Kaiyi</dc:creator> <dc:contributor>Zhao, Jian</dc:contributor> <dc:creator>Hurter, Christophe</dc:creator> <dc:contributor>Deussen, Oliver</dc:contributor> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/57994/1/Xue_2-7dhe2w3qqm8c2.pdf"/> <dc:contributor>Wang, Yunhai</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Xue, Mingliang</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:abstract xml:lang="eng">We present Target Netgrams as a visualization technique for radial layouts of graphs. Inspired by manually created target sociograms, we propose an annulus-constrained stress model that aims to position nodes onto the annuli between adjacent circles for indicating their radial hierarchy, while maintaining the network structure (clusters and neighborhoods) and improving readability as much as possible. This is achieved by having more space on the annuli than traditional layout techniques. By adapting stress majorization to this model, the layout is computed as a constrained least square optimization problem. Additional constraints (e.g., parent-child preservation, attribute-based clusters and structure-aware radii) are provided for exploring nodes, edges, and levels of interest. We demonstrate the effectiveness of our method through a comprehensive evaluation, a user study, and a case study.</dcterms:abstract> <dc:creator>Han, Chang</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-07-11T05:37:35Z</dc:date> <dc:contributor>Hurter, Christophe</dc:contributor> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/57994"/> <dc:language>eng</dc:language> <dc:creator>Xue, Mingliang</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:creator>Wang, Zheng</dc:creator> <dc:contributor>Zhang, Jian</dc:contributor> <dc:creator>Zhao, Jian</dc:creator> <dc:contributor>Han, Chang</dc:contributor> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/57994/1/Xue_2-7dhe2w3qqm8c2.pdf"/> <dc:creator>Wang, Yunhai</dc:creator> <dc:contributor>Wang, Zheng</dc:contributor> <dc:contributor>Zhang, Kaiyi</dc:contributor> <dc:creator>Deussen, Oliver</dc:creator> <dcterms:issued>2022-07-04</dcterms:issued> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:creator>Zhang, Jian</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-07-11T05:37:35Z</dcterms:available> <dc:rights>terms-of-use</dc:rights> <dcterms:title>Target Netgrams : An Annulus-Constrained Stress Model for Radial Graph Visualization</dcterms:title> </rdf:Description> </rdf:RDF>