Visualization of clustered directed acyclic graphs with node interleaving

Kumar, Pushpa; Zhang, Kang

doi:10.1145/1529282.1529685

Cited by 6 publications

(5 citation statements)

References 24 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, as pointed out by Fruchterman and Reingold [1], such a configuration might work poorly for complex graphs, because strong short-range repulsive forces often let the corresponding optimization be trapped in local minima. To alleviate this issue, Kumar et al [17] introduce a heuristic method that imposes an upper bound on the repulsive forces as a stopping condition for visualizing directed acyclic graphs. In contrast, short-range t-forces in our t-FDP model allow us to largely alleviate this issue for general graphs (see Section 3.3).…”

Section: Force-directed Graph Layoutsmentioning

confidence: 99%

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

Zhong

Xue

Zhang

et al. 2024

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

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.

show abstract

Section: Force-directed Graph Layoutsmentioning

confidence: 99%

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

Zhong

Xue

Zhang

et al. 2024

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

show abstract

“…Another aesthetic feature impacting graph readability is node overlapping. Two popular methods to reduce node overlapping are proposed in [12], [18].…”

Section: Monoplex Network Visualizationmentioning

confidence: 99%

A simple multiforce layout for multiplex networks

Fatemi¹,

Salehi²,

Magnani³

2016

Preprint

View full text Add to dashboard Cite

We introduce multiforce, a force-directed layout for multiplex networks, where the nodes of the network are organized into multiple layers and both in-layer and inter-layer relationships among nodes are used to compute node coordinates. The proposed approach generalizes existing work, providing a range of intermediate layouts in-between the ones produced by known methods. Our experiments on real data show that multiforce can keep nodes well aligned across different layers without significantly affecting their internal layouts when the layers have similar or compatible topologies. As a consequence, multiforce enriches the benefits of force-directed layouts by also supporting the identification of topological correspondences between layers.

show abstract

“…Force-directed methods are easy to implement and widely used in practice. Drawing graphs with forcedirected methods has been studied extensively (e.g., [7], [8], [19]). Force-directed algorithms treat a graph as a physical system.…”

Section: The Two Algorithmsmentioning

confidence: 99%

Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics

Huang

Eades

Hong

et al. 2010

2010 IEEE Symposium on Visual Languages and Human-Centric Computing

View full text Add to dashboard Cite

Many automatic graph drawing algorithms implement only one or two aesthetic criteria since most aesthetics conflict with each other. Empirical research has shown that although those algorithms are based on different aesthetics, drawings produced by them have comparable effectiveness.The comparable effectiveness raises a question about necessity of choosing one algorithm against another for drawing graphs when human performance is a main concern. In this paper, we argue that effectiveness can be improved when algorithms are designed by making compromises between aesthetics, rather than trying to satisfy one or two of them to the fullest. In particular, this paper presents a user study. The study compares effectiveness of drawings produced by two different force-directed methods, Classical spring algorithm and BIGANGLE. BIGANGLE produces drawings with a few aesthetics being improved at the same time. The experimental results indicate that BIGANGLE induces significantly better performance of humans in perceiving shortest paths between two nodes.

show abstract

Visualization of clustered directed acyclic graphs with node interleaving

Cited by 6 publications

References 24 publications

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

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

A simple multiforce layout for multiplex networks

Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics

Contact Info

Product

Resources

About