A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs

Monien, Burkhard and Ramme, Friedhelm and Salmen, Helmut (1996) A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 396-408(Official URL: http://dx.doi.org/10.1007/BFb0021823).

Full text not available from this repository.

Abstract

In this paper, we introduce a parallel simulated annealing algorithm for generating aesthetically pleasing straight-line drawings. The proposed algorithm calculates high quality 3D layouts of arbitrary undirected graphs. Due to the 3D layouts, structure information is presented to the human viewer at a glance. The computing time of the algorithm is reduced by a new parallel method for exploiting promising intermediate configurations. As the algorithm avoids running into a local minimum of the cost function, it is applicable for the animation of graphs of reasonably larger size than it was possible before. Subsequent to the discussion of the algorithm, empirical data for the performance of the algorithm and the quality of the generated layouts are presented.

Item Type:	Conference Paper
Additional Information:	10.1007/BFb0021823
Classifications:	P Styles > P.720 Straight-line G Algorithms and Complexity > G.999 Others P Styles > P.060 3D M Methods > M.200 Animation
URI:	http://gdea.informatik.uni-koeln.de/id/eprint/183

Actions (login required)

View Item