public class SuperPositionSVD extends SuperPositionAbstract
centered
Constructor and Description |
---|
SuperPositionSVD(boolean centered)
Constructor for the SVD superposition algorithm.
|
Modifier and Type | Method and Description |
---|---|
double |
getRmsd(javax.vecmath.Point3d[] x,
javax.vecmath.Point3d[] y)
Calculate the RMSD between two arrays of equivalent points that are not
superposed.
|
javax.vecmath.Matrix4d |
superpose(javax.vecmath.Point3d[] fixed,
javax.vecmath.Point3d[] moved)
Obtain the superposition matrix that minimizes the RMSD between two
arrays of equivalent points.
|
checkInput, setCentered, superposeAndTransform
public SuperPositionSVD(boolean centered)
centered
- true if the point arrays are centered at the origin (faster),
false otherwisepublic javax.vecmath.Matrix4d superpose(javax.vecmath.Point3d[] fixed, javax.vecmath.Point3d[] moved)
SuperPosition
The two point arrays have to be of the same length and the order of points have to be the same, so that a specific position in the one array is equivalent to the same position in the other array.
fixed
- point array as reference, onto which the other point array is
superposed. Original coordinates will not be modified.moved
- point array to which the resulting transformation matrix is
applied. Original coordinates will not be modified.public double getRmsd(javax.vecmath.Point3d[] x, javax.vecmath.Point3d[] y)
SuperPosition
This is equivalent to first superposing the point arrays with
SuperPosition.superposeAndTransform(Point3d[], Point3d[])
and
then calculating the RMSD of the superposed point arrays with
CalcPoint.rmsd(Point3d[], Point3d[])
, but it will be faster when
the transformation matrix is not needed.
The two point arrays have to be of the same length and the order of points have to be the same, so that a specific position in the one array is equivalent to the same position in the other array.
x
- an array of points. Original coordinates will not be modified.y
- an array of points. Original coordinates will not be modified.Copyright © 2000–2018 BioJava. All rights reserved.