Clement Levallois, Assistant Professor at EMLYON Business School.
The classic layout of Gephi extended to 3D.
1.0 — initial version (28 June 2013)
1.1 — conversion of nodes to spheres when layout in 3D (30 June 2013)
To simplify analyzing connections between groups in multipartite graphs, minimizing edge crossings is a good way to do so. In this work, by using the algorithm suggested in the paper “An Edge Crossing Minimization Algorithm Based on Adjacency Matrix Transformation”, implementation for gephi platform is performed.More Info
This plugin is developed as part of the “KSD research group”, where the German Research Center for Artificial Intelligence GmbH (DFKI), University of Kaiserslautern and the Technische Universität München (TUM) take part. “During the design process architects and students often study the plans of buildings that have already been built or designed. Such information is [...]More Info
On choosing a root node, this plugin allows you to layout the graph such the nodes that are ‘n’ hops away from the root lies on the ‘n’th circle. For a sample tutorial on how to use the plugin, check out the video below.More Info