Meva Dodo, F. Andriamanampisoa, P. Torguet, J. Jessel
{"title":"A new method to optimize the force-directed placement for 3D large graph drawing","authors":"Meva Dodo, F. Andriamanampisoa, P. Torguet, J. Jessel","doi":"10.1145/1294685.1294709","DOIUrl":null,"url":null,"abstract":"This paper describes a novel force-directed placement approach for 3D drawing of large graphs. The main idea behind our approach consists in optimizing the layout by equitably distributing vertices in the space. We consider the largest sphere inscribed in the 3D space and the vertices are then assigned random initial positions that are improved by force-directed placement. In order to ensure the effectiveness of the algorithm, we propose a new energy function minimization which uses the conjugated gradient of Fletcher-Reeves [1, 2]. Our algorithm is not only addressed to general undirected graphs but also it produces good layout of large trees. This work is motivated by our need to offer 3D visualization tools for large computing networks but this first phase will be focused on the graph representation.","PeriodicalId":325699,"journal":{"name":"International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1294685.1294709","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper describes a novel force-directed placement approach for 3D drawing of large graphs. The main idea behind our approach consists in optimizing the layout by equitably distributing vertices in the space. We consider the largest sphere inscribed in the 3D space and the vertices are then assigned random initial positions that are improved by force-directed placement. In order to ensure the effectiveness of the algorithm, we propose a new energy function minimization which uses the conjugated gradient of Fletcher-Reeves [1, 2]. Our algorithm is not only addressed to general undirected graphs but also it produces good layout of large trees. This work is motivated by our need to offer 3D visualization tools for large computing networks but this first phase will be focused on the graph representation.