Towards Partially Automatic Search of Edge Bundling Parameters
Edge bundling methods are used in flow maps and graphs to reduce the visual clutter, which is generated when representing complex and heterogeneous data. Nowadays, there are many edge bundling algorithms that have been successfully applied to a wide range of problems in graph representation. However, the majority of these methods are still difficult to use and apply on real world problems by the experts from other areas. This is due to the complexity of the algorithms and concepts behind them, as well as a strong dependence on their parametrization. In addition, the majority of edge bundling methods need to be fine-tuned when applied on different datasets. This paper presents a new approach that helps finding near-optimal parameters for solving such issues in edge bundling algorithms, regardless of the configuration of the input graph. Our method is based on evolutionary computation, allowing the users to find edge bundling solutions for their needs. In order to understand the effectiveness of the evolutionary algorithm in such kind of tasks, we performed experiments with automatic fitness functions, as well as with partially user-guided evolution. We tested our approach in the optimization of the parameters of two different edge bundling algorithms. Results are compared using objective criteria and a critical discussion of the obtained graphical solutions.
KeywordsInformation visualization Edge bundling Graph representation Genetic algorithm
This project has been supported by Fundação para a Ciência e Tecnologia (FCT), Portugal, under the grants SFRH/BD/109745/2015 and SFRH/BD/114865/2016.
- 1.Dent, B.: Dynamic representation: the design of flow maps. In: Cartography: Thematic Map Design, vol. 1. WCB/McGraw-Hill (1999)Google Scholar
- 2.Phan, D., Xiao, L., Yeh, R.B., Hanrahan, P., Winograd, T.: Flow map layout. In: IEEE Symposium on Information Visualization (InfoVis 2005), 23–25 October 2005, Minneapolis, MN, USA, p. 29 (2005)Google Scholar
- 6.Peysakhovich, V., Hurter, C., Telea, A.: Attribute-driven edge bundling for general graphs with applications in trail analysis. In: 2015 IEEE Pacific Visualization Symposium, PacificVis 2015, Hangzhou, China, 14–17 April 2015, pp. 39–46 (2015)Google Scholar
- 7.Polisciuc, E., Cruz, P., Amaro, H., Maçãs, C., Machado, P.: Flow map of products transported among warehouses and supermarkets. In: Proceedings of the 11th Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2016). IVAPP, Rome, Italy, 27–29 February 2016, vol. 2, pp. 179–188 (2016)Google Scholar
- 11.Machado, P., Cardoso, A.: NEvAr – the assessment of an evolutionary art tool. In: Wiggins, G. (ed.) AISB’00 Symposium on Creative and Cultural Aspects and Applications of AI and Cognitive Science, Birmingham, UK (2000)Google Scholar
- 12.Ralley, D.: Genetic algorithms as a tool for melodic development. In: International Computer Music Conference, pp. 501–502 (1995)Google Scholar
- 13.Rooke, S.: The evolutionary art of steven rooke (1996)Google Scholar
- 14.Sims, K.: Artificial evolution for computer graphics, vol. 25. ACM (1991)Google Scholar
- 17.Branke, J., Bucher, F., Schmeck, H.: Using genetic algorithms for drawing undirected graphs. In: The Third Nordic Workshop on Genetic Algorithms and their Applications. Citeseer (1996)Google Scholar
- 19.Wu, H.-Y., Takahashi, S., Lin, C.-C., Yen, H.-C.: A zone-based approach for placing annotation labels on metro maps. In: Dickmann, L., Volkmann, G., Malaka, R., Boll, S., Krüger, A., Olivier, P. (eds.) SG 2011. LNCS, vol. 6815, pp. 91–102. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22571-0_8 CrossRefGoogle Scholar