초록
This study is to suggest a visualization technique to display the relations of associated data in an optimal way when trying to display the whole data on a limited space by dealing with a large amount of data with linked information. For example, if you track an IP address through several steps and display the data on a screen, or if you visualize the human gene information on a 3-dimensional space, then it becomes even easier to understand the data flow in such cases. In order to simulate the technique given in this study, the given algorithm was applied to a large number of nodes made in a random fashion to optimize the data and we visually observed the result. According to the result, the technique given in this study is more efficient than any previous method in terms of visualization and utilizing space and allows to more easily understand the whole structure of a node because it consists of sub-groups.