An Efficient Method for the Coordinate Transformation Problem of Massively Three-Dimensional Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

An Efficient Method for the Coordinate Transformation Problem of Massively Three-Dimensional Networks

Abstract

A new and efficient algorithm is presented for the coordinate transformation problem of massively three-dimensional networks formed e.g. by the atoms of crystal fragments or molecular clusters. The new algorithm is based on a divide-and-conquer technique to perform iterative coordinate transformati- on, applicable even for three-dimensional networks, with linear scaling memory and near linear scaling CPU time requirements. The new algorithm proved to be very fast in the coordinate transformation problems and geometry optimization of diamond fragments, water clusters, globular proteins and solvated proteins.
Fichier principal
Vignette du fichier
RR-4083.pdf (248.1 Ko) Télécharger le fichier

Dates and versions

inria-00072550 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072550 , version 1

Cite

Károly Németh, Olivier Coulaud, Gérald Monard, János G. Angyán. An Efficient Method for the Coordinate Transformation Problem of Massively Three-Dimensional Networks. [Research Report] RR-4083, INRIA. 2000, pp.16. ⟨inria-00072550⟩
66 View
461 Download

Share

Gmail Facebook Twitter LinkedIn More