Visualization of clustered directed acyclic graphs without node overlapping

Pushpa Kumar; Kang Zhang; Yuke Wang

doi:10.1109/IV.2008.85

Visualization of clustered directed acyclic graphs without node overlapping

Pushpa Kumar^*, Kang Zhang, Yuke Wang

^*Corresponding author for this work

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

4 Citations (Scopus)

Abstract

Conventional force directed graph drawing methods aim to produce aesthetically pleasing visualization of graphs. The edges of the graph have more or less equal length, and there are as few crossing edges as possible. This paper proposes a new E-Spring algorithm for visualizing clustered directed acyclic graphs (DAGs) without node overlapping, extended from the popular spring embedder model. In our framework, nodes are modeled as non-uniform charged particles with weights, and a final drawing is derived by adjusting the positions of the nodes according to a combination of spring forces and repulsive forces derived from electrostatic forces between the nodes. Experimental results and visualization/analysis of this method are reported.

Original language	English
Title of host publication	Proceedings of 12th International Conference Information Visualisation, IV08
Pages	38-43
Number of pages	6
DOIs	https://doi.org/10.1109/IV.2008.85
Publication status	Published - 2008
Externally published	Yes
Event	12th International Conference Information Visualisation, IV08 - London, United Kingdom Duration: 9 Jul 2008 → 11 Jul 2008

Publication series

Name	Proceedings of the International Conference on Information Visualisation
ISSN (Print)	1093-9547

Conference

Conference	12th International Conference Information Visualisation, IV08
Country/Territory	United Kingdom
City	London
Period	9/07/08 → 11/07/08

Keywords

Directed acyclic graphs
Electrostatic forces
Force directed
Visualization

Access to Document

10.1109/IV.2008.85

Cite this

@inproceedings{986ae6c610974557b6ac1234ca441bee,

title = "Visualization of clustered directed acyclic graphs without node overlapping",

abstract = "Conventional force directed graph drawing methods aim to produce aesthetically pleasing visualization of graphs. The edges of the graph have more or less equal length, and there are as few crossing edges as possible. This paper proposes a new E-Spring algorithm for visualizing clustered directed acyclic graphs (DAGs) without node overlapping, extended from the popular spring embedder model. In our framework, nodes are modeled as non-uniform charged particles with weights, and a final drawing is derived by adjusting the positions of the nodes according to a combination of spring forces and repulsive forces derived from electrostatic forces between the nodes. Experimental results and visualization/analysis of this method are reported.",

keywords = "Directed acyclic graphs, Electrostatic forces, Force directed, Visualization",

author = "Pushpa Kumar and Kang Zhang and Yuke Wang",

year = "2008",

doi = "10.1109/IV.2008.85",

language = "English",

isbn = "9780769532684",

series = "Proceedings of the International Conference on Information Visualisation",

pages = "38--43",

booktitle = "Proceedings of 12th International Conference Information Visualisation, IV08",

note = "12th International Conference Information Visualisation, IV08 ; Conference date: 09-07-2008 Through 11-07-2008",

}

Kumar, P, Zhang, K & Wang, Y 2008, Visualization of clustered directed acyclic graphs without node overlapping. in Proceedings of 12th International Conference Information Visualisation, IV08., 4577923, Proceedings of the International Conference on Information Visualisation, pp. 38-43, 12th International Conference Information Visualisation, IV08, London, United Kingdom, 9/07/08. https://doi.org/10.1109/IV.2008.85

Visualization of clustered directed acyclic graphs without node overlapping. / Kumar, Pushpa; Zhang, Kang; Wang, Yuke.
Proceedings of 12th International Conference Information Visualisation, IV08. 2008. p. 38-43 4577923 (Proceedings of the International Conference on Information Visualisation).

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

TY - GEN

T1 - Visualization of clustered directed acyclic graphs without node overlapping

AU - Kumar, Pushpa

AU - Zhang, Kang

AU - Wang, Yuke

PY - 2008

Y1 - 2008

N2 - Conventional force directed graph drawing methods aim to produce aesthetically pleasing visualization of graphs. The edges of the graph have more or less equal length, and there are as few crossing edges as possible. This paper proposes a new E-Spring algorithm for visualizing clustered directed acyclic graphs (DAGs) without node overlapping, extended from the popular spring embedder model. In our framework, nodes are modeled as non-uniform charged particles with weights, and a final drawing is derived by adjusting the positions of the nodes according to a combination of spring forces and repulsive forces derived from electrostatic forces between the nodes. Experimental results and visualization/analysis of this method are reported.

AB - Conventional force directed graph drawing methods aim to produce aesthetically pleasing visualization of graphs. The edges of the graph have more or less equal length, and there are as few crossing edges as possible. This paper proposes a new E-Spring algorithm for visualizing clustered directed acyclic graphs (DAGs) without node overlapping, extended from the popular spring embedder model. In our framework, nodes are modeled as non-uniform charged particles with weights, and a final drawing is derived by adjusting the positions of the nodes according to a combination of spring forces and repulsive forces derived from electrostatic forces between the nodes. Experimental results and visualization/analysis of this method are reported.

KW - Directed acyclic graphs

KW - Electrostatic forces

KW - Force directed

KW - Visualization

UR - https://www.webofscience.com/wos/woscc/full-record/WOS:000259178400006

UR - https://www.scopus.com/pages/publications/52049113181

U2 - 10.1109/IV.2008.85

DO - 10.1109/IV.2008.85

M3 - Conference Paper published in a book

SN - 9780769532684

T3 - Proceedings of the International Conference on Information Visualisation

SP - 38

EP - 43

BT - Proceedings of 12th International Conference Information Visualisation, IV08

T2 - 12th International Conference Information Visualisation, IV08

Y2 - 9 July 2008 through 11 July 2008

ER -

Visualization of clustered directed acyclic graphs without node overlapping

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this