3D graph drawing with simulated annealing

32Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A recent trend in graph drawing is directed to the visualization of graphs in 3D [1, 5, 6]. A promising research direction concerns the extension of proven 2D techniques to 3D. We present a system extending the simulated annealing algorithm of Davidson and Harel [2] for straight-line two-dimensional drawings of general undirected graphs to three dimensions. This system features an advanced 3D user interface that assists the user in choosing and modifying the cost function and the optimization components on-line.

Cite

CITATION STYLE

APA

Cruz, I. F., & Twarog, J. P. (1996). 3D graph drawing with simulated annealing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1027, pp. 162–165). Springer Verlag. https://doi.org/10.1007/bfb0021800

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free