Dear Kalidas, I have a program written in Java that superposes a pair of point sets in 3D. It is an implementation of Umeyama's algorithm. It can easily be converted to C, however it computes the singular value decomposition of a three by three matrix using an external library (Jama). But I'm sure you can find SVD implementations in C and integrate into your code.
The zip bundle at the url below includes the Jama library. Just write "java superimpose" to run the program. http://www.ceng.metu.edu.tr/~tcan/misc/superimpose.zip Hope this helps. Tolga Can On Tue, May 12, 2009 at 7:52 AM, Kalidas Yeturu <[email protected]> wrote: > Dear All > > I would greatly appreciate if you can give a program that optimally > superposes a pair of point sets (3D) and outputs rotation and translation > matrices corresponding to each solution. > > I searched to my best in the web but could not find one. > > Please do NOT point to > - Protein-Protein superposition web-servers/standalone ones > - Programs that require residues to be contiguous in order to superpose > - Motif search programs > - IEEE/other literature on point set superposition algorithms without > corresponding implementation > > I need preferably C/Fortran program or as a last choice a library function > that I can call from other C programs. > > Thanking You > > -- > With Regards > Kalidas Y > http://ssl.serc.iisc.ernet.in/~kalidas > _______________________________________________ > BBB mailing list > [email protected] > http://www.bioinformatics.org/mailman/listinfo/bbb > _______________________________________________ BBB mailing list [email protected] http://www.bioinformatics.org/mailman/listinfo/bbb
