Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00072550
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 10:15:20 AM
Last modification on : Thursday, February 11, 2021 - 2:48:12 PM
Long-term archiving on: : Sunday, April 4, 2010 - 8:38:36 PM

Identifiers

  • HAL Id : inria-00072550, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

191

Files downloads

750