Towards unambiguous edge bundling

Investigating confluent drawings for network visualization

Benjamin Bach, Nathalie Henry Riche, Christophe Hurter, Kim Marriott, Tim Dwyer

    Research output: Contribution to journalArticleResearchpeer-review

    22 Citations (Scopus)

    Abstract

    In this paper, we investigate Confluent Drawings (CD), a technique for bundling edges in node-link diagrams based on network connectivity. Edge-bundling techniques are designed to reduce edge clutter in node-link diagrams by coalescing lines into common paths or bundles. Unfortunately, traditional bundling techniques introduce ambiguity since edges are only bundled by spatial proximity, rather than network connectivity; following an edge from its source to its target can lead to the perception of incorrect connectivity if edges are not clearly separated within the bundles. Contrary, CDs bundle edges based on common sources or targets. Thus, a smooth path along a confluent bundle indicates precise connectivity. While CDs have been described in theory, practical investigation and application to real-world networks (i.e., networks beyond those with certain planarity restrictions) is currently lacking. Here, we provide the first algorithm for constructing CDs from arbitrary directed and undirected networks and present a simple layout method, embedded in a sand box environment providing techniques for interactive exploration. We then investigate patterns and artifacts in CDs, which we compare to other common edge-bundling techniques. Finally, we present the first user study that compares edge-compression techniques, including CD, power graphs, metro-style, and common edge bundling. We found that users without particular expertise in visualization or network analysis are able to read small CDs without difficulty. Compared to existing bundling techniques, CDs are more likely to allow people to correctly perceive connectivity.

    Original languageEnglish
    Article number7539373
    Pages (from-to)541-550
    Number of pages10
    JournalIEEE Transactions on Visualization and Computer Graphics
    Volume23
    Issue number1
    DOIs
    Publication statusPublished - 1 Jan 2017

    Keywords

    • Bundling
    • Confluent
    • Edge compression
    • Network visualization
    • Power graph

    Cite this

    @article{5e3cd67d34254183a971cfe9c986cef8,
    title = "Towards unambiguous edge bundling: Investigating confluent drawings for network visualization",
    abstract = "In this paper, we investigate Confluent Drawings (CD), a technique for bundling edges in node-link diagrams based on network connectivity. Edge-bundling techniques are designed to reduce edge clutter in node-link diagrams by coalescing lines into common paths or bundles. Unfortunately, traditional bundling techniques introduce ambiguity since edges are only bundled by spatial proximity, rather than network connectivity; following an edge from its source to its target can lead to the perception of incorrect connectivity if edges are not clearly separated within the bundles. Contrary, CDs bundle edges based on common sources or targets. Thus, a smooth path along a confluent bundle indicates precise connectivity. While CDs have been described in theory, practical investigation and application to real-world networks (i.e., networks beyond those with certain planarity restrictions) is currently lacking. Here, we provide the first algorithm for constructing CDs from arbitrary directed and undirected networks and present a simple layout method, embedded in a sand box environment providing techniques for interactive exploration. We then investigate patterns and artifacts in CDs, which we compare to other common edge-bundling techniques. Finally, we present the first user study that compares edge-compression techniques, including CD, power graphs, metro-style, and common edge bundling. We found that users without particular expertise in visualization or network analysis are able to read small CDs without difficulty. Compared to existing bundling techniques, CDs are more likely to allow people to correctly perceive connectivity.",
    keywords = "Bundling, Confluent, Edge compression, Network visualization, Power graph",
    author = "Benjamin Bach and Riche, {Nathalie Henry} and Christophe Hurter and Kim Marriott and Tim Dwyer",
    year = "2017",
    month = "1",
    day = "1",
    doi = "10.1109/TVCG.2016.2598958",
    language = "English",
    volume = "23",
    pages = "541--550",
    journal = "IEEE Transactions on Visualization and Computer Graphics",
    issn = "1077-2626",
    publisher = "IEEE, Institute of Electrical and Electronics Engineers",
    number = "1",

    }

    Towards unambiguous edge bundling : Investigating confluent drawings for network visualization. / Bach, Benjamin; Riche, Nathalie Henry; Hurter, Christophe; Marriott, Kim; Dwyer, Tim.

    In: IEEE Transactions on Visualization and Computer Graphics, Vol. 23, No. 1, 7539373, 01.01.2017, p. 541-550.

    Research output: Contribution to journalArticleResearchpeer-review

    TY - JOUR

    T1 - Towards unambiguous edge bundling

    T2 - Investigating confluent drawings for network visualization

    AU - Bach, Benjamin

    AU - Riche, Nathalie Henry

    AU - Hurter, Christophe

    AU - Marriott, Kim

    AU - Dwyer, Tim

    PY - 2017/1/1

    Y1 - 2017/1/1

    N2 - In this paper, we investigate Confluent Drawings (CD), a technique for bundling edges in node-link diagrams based on network connectivity. Edge-bundling techniques are designed to reduce edge clutter in node-link diagrams by coalescing lines into common paths or bundles. Unfortunately, traditional bundling techniques introduce ambiguity since edges are only bundled by spatial proximity, rather than network connectivity; following an edge from its source to its target can lead to the perception of incorrect connectivity if edges are not clearly separated within the bundles. Contrary, CDs bundle edges based on common sources or targets. Thus, a smooth path along a confluent bundle indicates precise connectivity. While CDs have been described in theory, practical investigation and application to real-world networks (i.e., networks beyond those with certain planarity restrictions) is currently lacking. Here, we provide the first algorithm for constructing CDs from arbitrary directed and undirected networks and present a simple layout method, embedded in a sand box environment providing techniques for interactive exploration. We then investigate patterns and artifacts in CDs, which we compare to other common edge-bundling techniques. Finally, we present the first user study that compares edge-compression techniques, including CD, power graphs, metro-style, and common edge bundling. We found that users without particular expertise in visualization or network analysis are able to read small CDs without difficulty. Compared to existing bundling techniques, CDs are more likely to allow people to correctly perceive connectivity.

    AB - In this paper, we investigate Confluent Drawings (CD), a technique for bundling edges in node-link diagrams based on network connectivity. Edge-bundling techniques are designed to reduce edge clutter in node-link diagrams by coalescing lines into common paths or bundles. Unfortunately, traditional bundling techniques introduce ambiguity since edges are only bundled by spatial proximity, rather than network connectivity; following an edge from its source to its target can lead to the perception of incorrect connectivity if edges are not clearly separated within the bundles. Contrary, CDs bundle edges based on common sources or targets. Thus, a smooth path along a confluent bundle indicates precise connectivity. While CDs have been described in theory, practical investigation and application to real-world networks (i.e., networks beyond those with certain planarity restrictions) is currently lacking. Here, we provide the first algorithm for constructing CDs from arbitrary directed and undirected networks and present a simple layout method, embedded in a sand box environment providing techniques for interactive exploration. We then investigate patterns and artifacts in CDs, which we compare to other common edge-bundling techniques. Finally, we present the first user study that compares edge-compression techniques, including CD, power graphs, metro-style, and common edge bundling. We found that users without particular expertise in visualization or network analysis are able to read small CDs without difficulty. Compared to existing bundling techniques, CDs are more likely to allow people to correctly perceive connectivity.

    KW - Bundling

    KW - Confluent

    KW - Edge compression

    KW - Network visualization

    KW - Power graph

    UR - http://www.scopus.com/inward/record.url?scp=84998911173&partnerID=8YFLogxK

    U2 - 10.1109/TVCG.2016.2598958

    DO - 10.1109/TVCG.2016.2598958

    M3 - Article

    VL - 23

    SP - 541

    EP - 550

    JO - IEEE Transactions on Visualization and Computer Graphics

    JF - IEEE Transactions on Visualization and Computer Graphics

    SN - 1077-2626

    IS - 1

    M1 - 7539373

    ER -