Power System Connectivity Visualization Using an Orthogonal Graph Layout Algorithm Based on the Space-Filling Technique

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 was performed based on the connection relationship between nodes, and the obtained clusters were 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 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 revealed that the proposed method considerably improved edge crossing, edge bending, and edge length.