Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
EU-Projektnummer
DFG-Projektnummer
Projekt
Open Access-Veröffentlichung
Sammlungen
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
We present an improved stress majorization method that incorporates various constraints, including directional constraints without the necessity of solving a constraint optimization problem. This is achieved by reformulating the stress function to impose constraints on both the edge vectors and lengths instead of just on the edge lengths (node distances). This is a unified framework for both constrained and unconstrained graph visualizations, where we can model most existing layout constraints, as well as develop new ones such as the star shapes and cluster separation constraints within stress majorization. This improvement also allows us to parallelize computation with an efficient GPU conjugant gradient solver, which yields fast and stable solutions, even for large graphs. As a result, we allow the constraint-based exploration of large graphs with 10K nodes - an approach which previous methods cannot support.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
WANG, Yunhai, Yanyan WANG, Yinqi SUN, Lifeng ZHU, Kecheng LU, Chi-Wing FU, Michael SEDLMAIR, Oliver DEUSSEN, Baoquan CHEN, 2018. Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization. In: IEEE Transactions on Visualization and Computer Graphics. 2018, 24(1), pp. 489-499. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2017.2745919BibTex
@article{Wang2018-01Revis-41124, year={2018}, doi={10.1109/TVCG.2017.2745919}, title={Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization}, number={1}, volume={24}, issn={1077-2626}, journal={IEEE Transactions on Visualization and Computer Graphics}, pages={489--499}, author={Wang, Yunhai and Wang, Yanyan and Sun, Yinqi and Zhu, Lifeng and Lu, Kecheng and Fu, Chi-Wing and Sedlmair, Michael and Deussen, Oliver and Chen, Baoquan} }
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/41124"> <dc:creator>Zhu, Lifeng</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/41124"/> <dc:contributor>Deussen, Oliver</dc:contributor> <dc:contributor>Wang, Yunhai</dc:contributor> <dc:contributor>Sun, Yinqi</dc:contributor> <dc:contributor>Sedlmair, Michael</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-01-24T10:01:39Z</dc:date> <dc:creator>Fu, Chi-Wing</dc:creator> <dc:contributor>Wang, Yanyan</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-01-24T10:01:39Z</dcterms:available> <dc:creator>Deussen, Oliver</dc:creator> <dc:creator>Sun, Yinqi</dc:creator> <dcterms:abstract xml:lang="eng">We present an improved stress majorization method that incorporates various constraints, including directional constraints without the necessity of solving a constraint optimization problem. This is achieved by reformulating the stress function to impose constraints on both the edge vectors and lengths instead of just on the edge lengths (node distances). This is a unified framework for both constrained and unconstrained graph visualizations, where we can model most existing layout constraints, as well as develop new ones such as the star shapes and cluster separation constraints within stress majorization. This improvement also allows us to parallelize computation with an efficient GPU conjugant gradient solver, which yields fast and stable solutions, even for large graphs. As a result, we allow the constraint-based exploration of large graphs with 10K nodes - an approach which previous methods cannot support.</dcterms:abstract> <dc:creator>Lu, Kecheng</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:contributor>Lu, Kecheng</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:creator>Sedlmair, Michael</dc:creator> <dcterms:title>Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization</dcterms:title> <dc:contributor>Zhu, Lifeng</dc:contributor> <dc:creator>Wang, Yanyan</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:creator>Chen, Baoquan</dc:creator> <dc:contributor>Chen, Baoquan</dc:contributor> <dc:language>eng</dc:language> <dc:creator>Wang, Yunhai</dc:creator> <dc:contributor>Fu, Chi-Wing</dc:contributor> <dcterms:issued>2018-01</dcterms:issued> </rdf:Description> </rdf:RDF>