## Force-Directed Graph Layouts Revisited : A New Force Based on the T-Distribution

No Thumbnail Available
##### Files
There are no files associated with this item.
2023
Zhong, Fahai
Xue, Mingliang
Zhang, Jian
Zhang, Fan
Ban, Rui
Wang, Yunhai
Journal article
Published
##### Published in
IEEE Transactions on Visualization and Computer Graphics ; 2023. - IEEE. - ISSN 1077-2626. - eISSN 1941-0506
##### Abstract
In this paper, we propose the t-FDP model, a force-directed placement method based on a novel bounded short-range force (t-force) defined by Student’s t-distribution. Our formulation is flexible, exerts limited repulsive forces for nearby nodes and can be adapted separately in its short- and long-range effects. Using such forces in force-directed graph layouts yields better neighborhood preservation than current methods, while maintaining low stress errors. Our efficient implementation using a Fast Fourier Transform is one order of magnitude faster than state-of-the-art methods and two orders faster on the GPU, enabling us to perform parameter tuning by globally and locally adjusting the t-force in real-time for complex graphs. We demonstrate the quality of our approach by numerical evaluation against state-of-the-art approaches and extensions for interactive exploration.
##### Subject (DDC)
004 Computer Science
##### Cite This
ISO 690ZHONG, Fahai, Mingliang XUE, Jian ZHANG, Fan ZHANG, Rui BAN, Oliver DEUSSEN, Yunhai WANG, 2023. Force-Directed Graph Layouts Revisited : A New Force Based on the T-Distribution. In: IEEE Transactions on Visualization and Computer Graphics. IEEE. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2023.3238821
BibTex
@article{Zhong2023Force-60002,
year={2023},
doi={10.1109/TVCG.2023.3238821},
title={Force-Directed Graph Layouts Revisited : A New Force Based on the T-Distribution},
issn={1077-2626},
journal={IEEE Transactions on Visualization and Computer Graphics},
author={Zhong, Fahai and Xue, Mingliang and Zhang, Jian and Zhang, Fan and Ban, Rui and Deussen, Oliver and Wang, Yunhai}
}

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#" >
<dc:language>eng</dc:language>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dc:creator>Zhang, Fan</dc:creator>
<dc:creator>Wang, Yunhai</dc:creator>
<dc:contributor>Zhong, Fahai</dc:contributor>
<dc:creator>Zhong, Fahai</dc:creator>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:contributor>Xue, Mingliang</dc:contributor>
<dcterms:abstract xml:lang="eng">In this paper, we propose the t-FDP model, a force-directed placement method based on a novel bounded short-range force (t-force) defined by Student’s t-distribution. Our formulation is flexible, exerts limited repulsive forces for nearby nodes and can be adapted separately in its short- and long-range effects. Using such forces in force-directed graph layouts yields better neighborhood preservation than current methods, while maintaining low stress errors. Our efficient implementation using a Fast Fourier Transform is one order of magnitude faster than state-of-the-art methods and two orders faster on the GPU, enabling us to perform parameter tuning by globally and locally adjusting the t-force in real-time for complex graphs. We demonstrate the quality of our approach by numerical evaluation against state-of-the-art approaches and extensions for interactive exploration.</dcterms:abstract>
<dcterms:title>Force-Directed Graph Layouts Revisited : A New Force Based on the T-Distribution</dcterms:title>
<dc:creator>Xue, Mingliang</dc:creator>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:contributor>Wang, Yunhai</dc:contributor>
<dc:contributor>Zhang, Fan</dc:contributor>
<dcterms:issued>2023</dcterms:issued>
<dc:creator>Zhang, Jian</dc:creator>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/60002"/>
<dc:rights>terms-of-use</dc:rights>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-01-31T12:11:19Z</dc:date>
<dc:creator>Ban, Rui</dc:creator>
<dc:contributor>Zhang, Jian</dc:contributor>
<dc:contributor>Ban, Rui</dc:contributor>
<dc:contributor>Deussen, Oliver</dc:contributor>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-01-31T12:11:19Z</dcterms:available>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:creator>Deussen, Oliver</dc:creator>
</rdf:Description>
</rdf:RDF>

Yes
##### Refereed
Yes
Online First: Journal articles that are published online before they appear as an actual part of a journal issue. Online first articles are published on the journal's website in the publisher's version.