Mental Map-Preserving Visualization through a Genetic Algorithm

被引:2
作者
Dehvari, Mojiborrahman [1 ]
Yang, Chuan-Kai [1 ]
Armando, Enrico [1 ]
机构
[1] Natl Taiwan Univ Sci & Technol, Sch Management, Dept Informat Management, Taipei 106335, Taiwan
来源
APPLIED SCIENCES-BASEL | 2021年 / 11卷 / 10期
关键词
dynamic graph drawing; genetic algorithm; network structure; drawing algorithm; mental map preservation; graph visualization animation;
D O I
10.3390/app11104336
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
The video game industry has evolved significantly, with different genres becoming popular over time, but how to visualize such information by curating data into a form that makes it easier to identify and understand the trends is quite an interesting research topic. This research focuses on producing an animation of aesthetically pleasing two-dimensional (2D) undirected graphs based on PC video game datasets. The data are further analyzed for developing a web-based application giving users the ability to control and create the animation of a graph. To make it easier to understand the animation of a graph, the changes between the displays of the previous and the following periods are set as small as possible, allowing a user to grasp the differences of the graph's structure faster. A genetic algorithm-based undirected graph drawing that minimizes both the aesthetic criteria and mental map cost are proposed in this research to tackle this problem. Furthermore, based on our experiments, we could find the best period to start with, so we do not necessarily need to start from the first period to calculate the animation result. Our experiment results proved that a smoother animation could be achieved, and information is better preserved throughout the animation.
引用
收藏
页数:17
相关论文
共 20 条
[1]   Graph layout using a genetic algorithm [J].
Barreto, AMS ;
Barbosa, HJC .
SIXTH BRAZILIAN SYMPOSIUM ON NEURAL NETWORKS, VOL 1, PROCEEDINGS, 2000, :179-184
[2]  
Branke J, 1997, PROCEEDINGS OF THE THIRD NORDIC WORKSHOP ON GENETIC ALGORITHMS AND THEIR APPLICATIONS (3NWGA), P193
[3]  
Bridgeman S., 2004, GRAPH ALGORITHMS APP, P225
[4]   Drawing graphs nicely using simulated annealing [J].
Davidson, R ;
Harel, D .
ACM TRANSACTIONS ON GRAPHICS, 1996, 15 (04) :301-331
[5]   Graph drawing using tabu search coupled with path relinking [J].
Dib, Fadi K. ;
Rodgers, Peter .
PLOS ONE, 2018, 13 (05)
[6]  
Eades P., 1991, COMPUGRAPHICS, P24
[7]   GRAPH DRAWING BY FORCE-DIRECTED PLACEMENT [J].
FRUCHTERMAN, TMJ ;
REINGOLD, EM .
SOFTWARE-PRACTICE & EXPERIENCE, 1991, 21 (11) :1129-1164
[8]   GENERALIZED PROCRUSTES ANALYSIS [J].
GOWER, JC .
PSYCHOMETRIKA, 1975, 40 (01) :33-51
[9]   AN ALGORITHM FOR DRAWING GENERAL UNDIRECTED GRAPHS [J].
KAMADA, T ;
KAWAI, S .
INFORMATION PROCESSING LETTERS, 1989, 31 (01) :7-15
[10]  
Kravchenko O, GEN PROCRUSTES ANAL