AutoFDP : Automatic Force-based Model Selection for Multicriteria Graph Drawing

dc.contributor.authorXue, Mingliang
dc.contributor.authorWang, Yifan
dc.contributor.authorWang, Zhi
dc.contributor.authorZhu, Lifeng
dc.contributor.authorCui, Lizhen
dc.contributor.authorChen, Yueguo
dc.contributor.authorDing, Zhiyu
dc.contributor.authorDeussen, Oliver
dc.contributor.authorWang, Yunhai
dc.date.accessioned2025-11-25T05:45:23Z
dc.date.available2025-11-25T05:45:23Z
dc.date.issued2026-02
dc.description.abstractTraditional force-based graph layout models are rooted in virtual physics, while criteria-driven techniques position nodes by directly optimizing graph readability criteria. In this paper, we systematically explore the integration of these two approaches, introducing criteria-driven force-based graph layout techniques. We propose a general framework that, based on user-specified readability criteria, such as minimizing edge crossings, automatically constructs a force-based model tailored to generate layouts for a given graph. Models derived from highly similar graphs can be reused to create initial layouts, users can further refine layouts by imposing different criteria on subgraphs. We perform quantitative comparisons between our layout methods and existing techniques across various graphs and present a case study on graph exploration. Our results indicate that our framework generates superior layouts compared to existing techniques and exhibits better generalization capabilities than deep learning-based methods.
dc.description.versionpublisheddeu
dc.identifier.doi10.1109/tvcg.2025.3631659
dc.identifier.urihttps://kops.uni-konstanz.de/handle/123456789/75295
dc.language.isoeng
dc.subjectLayout
dc.subjectForce
dc.subjectComputational modeling
dc.subjectOptimization
dc.subjectStress
dc.subjectSprings
dc.subjectTraining
dc.subjectGraph drawing
dc.subjectLearning systems
dc.subjectTraining data
dc.subject.ddc004
dc.titleAutoFDP : Automatic Force-based Model Selection for Multicriteria Graph Drawingeng
dc.typeJOURNAL_ARTICLE
dspace.entity.typePublication
kops.citation.bibtex
@article{Xue2026-02AutoF-75295,
  title={AutoFDP : Automatic Force-based Model Selection for Multicriteria Graph Drawing},
  year={2026},
  doi={10.1109/tvcg.2025.3631659},
  number={2},
  volume={32},
  issn={1077-2626},
  journal={IEEE Transactions on Visualization and Computer Graphics},
  pages={1554--1568},
  author={Xue, Mingliang and Wang, Yifan and Wang, Zhi and Zhu, Lifeng and Cui, Lizhen and Chen, Yueguo and Ding, Zhiyu and Deussen, Oliver and Wang, Yunhai}
}
kops.citation.iso690XUE, Mingliang, Yifan WANG, Zhi WANG, Lifeng ZHU, Lizhen CUI, Yueguo CHEN, Zhiyu DING, Oliver DEUSSEN, Yunhai WANG, 2026. AutoFDP : Automatic Force-based Model Selection for Multicriteria Graph Drawing. In: IEEE Transactions on Visualization and Computer Graphics. IEEE. 2026, 32(2), S. 1554-1568. ISSN 1077-2626. eISSN 1941-0506. Verfügbar unter: doi: 10.1109/tvcg.2025.3631659deu
kops.citation.iso690XUE, Mingliang, Yifan WANG, Zhi WANG, Lifeng ZHU, Lizhen CUI, Yueguo CHEN, Zhiyu DING, Oliver DEUSSEN, Yunhai WANG, 2026. AutoFDP : Automatic Force-based Model Selection for Multicriteria Graph Drawing. In: IEEE Transactions on Visualization and Computer Graphics. IEEE. 2026, 32(2), pp. 1554-1568. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/tvcg.2025.3631659eng
kops.citation.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/75295">
    <dc:creator>Xue, Mingliang</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2025-11-25T05:45:23Z</dc:date>
    <dc:contributor>Xue, Mingliang</dc:contributor>
    <dc:creator>Wang, Yifan</dc:creator>
    <dc:contributor>Chen, Yueguo</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/75295"/>
    <dc:creator>Wang, Zhi</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Deussen, Oliver</dc:creator>
    <dc:contributor>Zhu, Lifeng</dc:contributor>
    <dc:contributor>Deussen, Oliver</dc:contributor>
    <dcterms:issued>2026-02</dcterms:issued>
    <dc:creator>Ding, Zhiyu</dc:creator>
    <dcterms:title>AutoFDP : Automatic Force-based Model Selection for Multicriteria Graph Drawing</dcterms:title>
    <dc:contributor>Wang, Zhi</dc:contributor>
    <dc:contributor>Wang, Yifan</dc:contributor>
    <dc:creator>Chen, Yueguo</dc:creator>
    <dc:contributor>Ding, Zhiyu</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Wang, Yunhai</dc:creator>
    <dc:contributor>Cui, Lizhen</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Wang, Yunhai</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2025-11-25T05:45:23Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Zhu, Lifeng</dc:creator>
    <dcterms:abstract>Traditional force-based graph layout models are rooted in virtual physics, while criteria-driven techniques position nodes by directly optimizing graph readability criteria. In this paper, we systematically explore the integration of these two approaches, introducing criteria-driven force-based graph layout techniques. We propose a general framework that, based on user-specified readability criteria, such as minimizing edge crossings, automatically constructs a force-based model tailored to generate layouts for a given graph. Models derived from highly similar graphs can be reused to create initial layouts, users can further refine layouts by imposing different criteria on subgraphs. We perform quantitative comparisons between our layout methods and existing techniques across various graphs and present a case study on graph exploration. Our results indicate that our framework generates superior layouts compared to existing techniques and exhibits better generalization capabilities than deep learning-based methods.</dcterms:abstract>
    <dc:language>eng</dc:language>
    <dc:creator>Cui, Lizhen</dc:creator>
  </rdf:Description>
</rdf:RDF>
kops.description.funding{"first":"nsfc","second":"62402284"}
kops.flag.isPeerReviewedtrue
kops.flag.knbibliographytrue
kops.sourcefieldIEEE Transactions on Visualization and Computer Graphics. IEEE. 2026, <b>32</b>(2), S. 1554-1568. ISSN 1077-2626. eISSN 1941-0506. Verfügbar unter: doi: 10.1109/tvcg.2025.3631659deu
kops.sourcefield.plainIEEE Transactions on Visualization and Computer Graphics. IEEE. 2026, 32(2), S. 1554-1568. ISSN 1077-2626. eISSN 1941-0506. Verfügbar unter: doi: 10.1109/tvcg.2025.3631659deu
kops.sourcefield.plainIEEE Transactions on Visualization and Computer Graphics. IEEE. 2026, 32(2), pp. 1554-1568. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/tvcg.2025.3631659eng
relation.isAuthorOfPublication4e85f041-bb89-4e27-b7d6-acd814feacb8
relation.isAuthorOfPublication.latestForDiscovery4e85f041-bb89-4e27-b7d6-acd814feacb8
source.bibliographicInfo.fromPage1554
source.bibliographicInfo.issue2
source.bibliographicInfo.toPage1568
source.bibliographicInfo.volume32
source.identifier.eissn1941-0506
source.identifier.issn1077-2626
source.periodicalTitleIEEE Transactions on Visualization and Computer Graphics
source.publisherIEEE
temp.description.funding{"first":"National Natural Science Foundation of China","second":"62402284"}

Dateien