Graph-drawing algorithms geometries versus molecular mechanics in fullereness
✍ Scribed by M. Kaufman; T. Pisanski; D. Lukman; B. Borštnik; A. Graovac
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 352 KB
- Volume
- 259
- Category
- Article
- ISSN
- 0009-2614
No coin nor oath required. For personal study only.
✦ Synopsis
The algorithms of Kamada-Kawai (KK) and Fruchterman-Reingold (FR) have been recently generalized (Pisanski et al., Croat. Chem. Acta 68 (1995) 283) in order to draw molecular graphs in three-dimensional space. The quality of KK and FR geometries is studied here by comparing them with the molecular mechanics (MM) and the adjacency matrix eigenvectors (AME) algorithm geometries. In order to compare different layouts of the same molecule, an appropriate method has been developed. Its application to a series of experimentally detected fullerenes indicates that the KK, FR and AME algorithms are able to reproduce plausible molecular geometries.