mirror of
https://github.com/rdkit/rdkit.git
synced 2026-06-03 21:44:30 +08:00
* move distance constraint to forcefield * move position and torsion constraint to force field, also remove some unused includes * sorting includes * add missing files
143 lines
5.4 KiB
C++
143 lines
5.4 KiB
C++
//
|
|
// Copyright (C) 2004-2024 Paolo Tosco and other RDKit contributors
|
|
//
|
|
// @@ All Rights Reserved @@
|
|
// This file is part of the RDKit.
|
|
// The contents are covered by the terms of the BSD license
|
|
// which is included in the file license.txt, found at the root
|
|
// of the RDKit source tree.
|
|
//
|
|
#include "ForceField.h"
|
|
#include "AngleConstraint.h"
|
|
#include <RDGeneral/Invariant.h>
|
|
#include <cmath>
|
|
|
|
#ifndef M_PI
|
|
#define M_PI 3.14159265358979323846
|
|
#endif
|
|
|
|
namespace ForceFields {
|
|
constexpr double RAD2DEG = 180.0 / M_PI;
|
|
AngleConstraintContrib::AngleConstraintContrib(
|
|
ForceField *owner, unsigned int idx1, unsigned int idx2, unsigned int idx3,
|
|
double minAngleDeg, double maxAngleDeg, double forceConst) {
|
|
PRECONDITION(owner, "bad owner");
|
|
RANGE_CHECK(0.0, minAngleDeg, 180.0);
|
|
RANGE_CHECK(0.0, maxAngleDeg, 180.0);
|
|
URANGE_CHECK(idx1, owner->positions().size());
|
|
URANGE_CHECK(idx2, owner->positions().size());
|
|
URANGE_CHECK(idx3, owner->positions().size());
|
|
PRECONDITION(!(minAngleDeg > maxAngleDeg),
|
|
"minAngleDeg must be <= maxAngleDeg");
|
|
|
|
dp_forceField = owner;
|
|
d_at1Idx = idx1;
|
|
d_at2Idx = idx2;
|
|
d_at3Idx = idx3;
|
|
d_minAngleDeg = minAngleDeg;
|
|
d_maxAngleDeg = maxAngleDeg;
|
|
d_forceConstant = forceConst;
|
|
}
|
|
|
|
AngleConstraintContrib::AngleConstraintContrib(
|
|
ForceField *owner, unsigned int idx1, unsigned int idx2, unsigned int idx3,
|
|
bool relative, double minAngleDeg, double maxAngleDeg, double forceConst) {
|
|
PRECONDITION(owner, "bad owner");
|
|
const RDGeom::PointPtrVect &pos = owner->positions();
|
|
URANGE_CHECK(idx1, pos.size());
|
|
URANGE_CHECK(idx2, pos.size());
|
|
URANGE_CHECK(idx3, pos.size());
|
|
PRECONDITION(!(minAngleDeg > maxAngleDeg),
|
|
"minAngleDeg must be <= maxAngleDeg");
|
|
if (relative) {
|
|
const RDGeom::Point3D &p1 = *((RDGeom::Point3D *)pos[idx1]);
|
|
const RDGeom::Point3D &p2 = *((RDGeom::Point3D *)pos[idx2]);
|
|
const RDGeom::Point3D &p3 = *((RDGeom::Point3D *)pos[idx3]);
|
|
const RDGeom::Point3D r[2] = {p1 - p2, p3 - p2};
|
|
const double rLengthSq[2] = {std::max(1.0e-5, r[0].lengthSq()),
|
|
std::max(1.0e-5, r[1].lengthSq())};
|
|
double cosTheta = r[0].dotProduct(r[1]) / sqrt(rLengthSq[0] * rLengthSq[1]);
|
|
cosTheta = std::clamp(cosTheta, -1.0, 1.0);
|
|
const double angle = RAD2DEG * acos(cosTheta);
|
|
minAngleDeg += angle;
|
|
maxAngleDeg += angle;
|
|
}
|
|
RANGE_CHECK(0.0, minAngleDeg, 180.0);
|
|
RANGE_CHECK(0.0, maxAngleDeg, 180.0);
|
|
dp_forceField = owner;
|
|
d_at1Idx = idx1;
|
|
d_at2Idx = idx2;
|
|
d_at3Idx = idx3;
|
|
d_minAngleDeg = minAngleDeg;
|
|
d_maxAngleDeg = maxAngleDeg;
|
|
d_forceConstant = forceConst;
|
|
}
|
|
|
|
double AngleConstraintContrib::computeAngleTerm(double angle) const {
|
|
double angleTerm = 0.0;
|
|
if (angle < d_minAngleDeg) {
|
|
angleTerm = angle - d_minAngleDeg;
|
|
} else if (angle > d_maxAngleDeg) {
|
|
angleTerm = angle - d_maxAngleDeg;
|
|
}
|
|
return angleTerm;
|
|
}
|
|
|
|
double AngleConstraintContrib::getEnergy(double *pos) const {
|
|
PRECONDITION(dp_forceField, "no owner");
|
|
PRECONDITION(pos, "bad vector");
|
|
|
|
const RDGeom::Point3D p1(pos[3 * d_at1Idx], pos[3 * d_at1Idx + 1],
|
|
pos[3 * d_at1Idx + 2]);
|
|
const RDGeom::Point3D p2(pos[3 * d_at2Idx], pos[3 * d_at2Idx + 1],
|
|
pos[3 * d_at2Idx + 2]);
|
|
const RDGeom::Point3D p3(pos[3 * d_at3Idx], pos[3 * d_at3Idx + 1],
|
|
pos[3 * d_at3Idx + 2]);
|
|
const RDGeom::Point3D r[2] = {p1 - p2, p3 - p2};
|
|
const double rLengthSq[2] = {std::max(1.0e-5, r[0].lengthSq()),
|
|
std::max(1.0e-5, r[1].lengthSq())};
|
|
double cosTheta = r[0].dotProduct(r[1]) / sqrt(rLengthSq[0] * rLengthSq[1]);
|
|
cosTheta = std::clamp(cosTheta, -1.0, 1.0);
|
|
const double angle = RAD2DEG * acos(cosTheta);
|
|
const double angleTerm = computeAngleTerm(angle);
|
|
return d_forceConstant * angleTerm * angleTerm;
|
|
}
|
|
|
|
void AngleConstraintContrib::getGrad(double *pos, double *grad) const {
|
|
PRECONDITION(dp_forceField, "no owner");
|
|
PRECONDITION(pos, "bad vector");
|
|
PRECONDITION(grad, "bad vector");
|
|
|
|
const RDGeom::Point3D p1(pos[3 * d_at1Idx], pos[3 * d_at1Idx + 1],
|
|
pos[3 * d_at1Idx + 2]);
|
|
const RDGeom::Point3D p2(pos[3 * d_at2Idx], pos[3 * d_at2Idx + 1],
|
|
pos[3 * d_at2Idx + 2]);
|
|
const RDGeom::Point3D p3(pos[3 * d_at3Idx], pos[3 * d_at3Idx + 1],
|
|
pos[3 * d_at3Idx + 2]);
|
|
const RDGeom::Point3D r[2] = {p1 - p2, p3 - p2};
|
|
const double rLengthSq[2] = {std::max(1.0e-5, r[0].lengthSq()),
|
|
std::max(1.0e-5, r[1].lengthSq())};
|
|
double cosTheta = r[0].dotProduct(r[1]) / sqrt(rLengthSq[0] * rLengthSq[1]);
|
|
cosTheta = std::clamp(cosTheta, -1.0, 1.0);
|
|
const double angle = RAD2DEG * acos(cosTheta);
|
|
const double angleTerm = computeAngleTerm(angle);
|
|
|
|
double dE_dTheta = 2.0 * RAD2DEG * d_forceConstant * angleTerm;
|
|
|
|
RDGeom::Point3D rp = r[1].crossProduct(r[0]);
|
|
double prefactor = dE_dTheta / std::max(1.0e-5, rp.length());
|
|
double t[2] = {-prefactor / rLengthSq[0], prefactor / rLengthSq[1]};
|
|
RDGeom::Point3D dedp[3];
|
|
dedp[0] = r[0].crossProduct(rp) * t[0];
|
|
dedp[2] = r[1].crossProduct(rp) * t[1];
|
|
dedp[1] = -dedp[0] - dedp[2];
|
|
double *g[3] = {&(grad[3 * d_at1Idx]), &(grad[3 * d_at2Idx]),
|
|
&(grad[3 * d_at3Idx])};
|
|
for (unsigned int i = 0; i < 3; ++i) {
|
|
g[i][0] += dedp[i].x;
|
|
g[i][1] += dedp[i].y;
|
|
g[i][2] += dedp[i].z;
|
|
}
|
|
}
|
|
} // namespace ForceFields
|