JCSE, vol. 16, no. 4, pp.233-243, 2022
DOI: http://dx.doi.org/10.5626/JCSE.2022.16.4.233
Power System Connectivity Visualization Using an Orthogonal Graph Layout Algorithm Based on the Space-Filling Technique
San Hong, Sangjun Park, Chanil Kim, and Hyunjoo Song
School of Computer Science and Engineering, Soongsil University, Seoul, Korea
Abstract: In this study, a novel orthogonal graph layout algorithm was proposed to efficiently represent the connection relationship
between each node in power system data. The proposed layout algorithm is a four-stage algorithm. First, clustering is
performed based on the connection relationship between nodes, and the obtained clusters are placed close to squares by
using the squarified treemap technique to fully utilize the given space. Next, adjacent nodes were arranged in a snakelike
order in each cluster according to the characteristics of the IEEE test system data. The links were then arranged
according to the positional relationship of the pairs of connected nodes. Each node had several ports so that links could
be distributed evenly according to the direction of the links. A case in which all nodes were arranged orthogonally in an
arbitrary manner without performing clustering; a case in which adjacent nodes within each cluster were arranged in an
arbitrary order after only performing clustering; and a case where adjacent nodes within each cluster were arranged in
row-major order after only performing clustering were compared. The results verified that the proposed method
improved edge crossing, edge bending, and edge length considerably.
Keyword:
Graph layout algorithm; Orthogonal layout; Space-filling technique; Power system visualization; Visualization; Human-computer interaction
Full Paper: 289 Downloads, 793 View
|