1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
// $Id: TriangleSmooth.cpp 1528 2010-09-26 17:04:37Z glandrum $
//
// Copyright (C) 2004-2006 Rational Discovery LLC
//
// @@ 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 "BoundsMatrix.h"
#include "TriangleSmooth.h"
namespace DistGeom {
bool triangleSmoothBounds(BoundsMatPtr boundsMat) {
return triangleSmoothBounds(boundsMat.get());
}
bool triangleSmoothBounds(BoundsMatrix *boundsMat) {
int npt = boundsMat->numRows();
int i, j, k;
double Uik, Lik, Ukj, sumUikUkj, diffLikUjk, diffLjkUik;
for (k = 0; k < npt; k++) {
for (i = 0; i < npt-1; i++) {
if (i == k) {
continue;
}
Uik = boundsMat->getUpperBound(i,k);
Lik = boundsMat->getLowerBound(i,k);
for (j = i+1; j < npt; j++) {
if (j == k) {
continue;
}
Ukj = boundsMat->getUpperBound(k,j);
sumUikUkj = Uik + Ukj;
if (boundsMat->getUpperBound(i,j) > sumUikUkj) {
boundsMat->setUpperBound(i,j, sumUikUkj);
}
diffLikUjk = Lik - Ukj;
diffLjkUik = boundsMat->getLowerBound(j,k) - Uik;
if (boundsMat->getLowerBound(i,j) < diffLikUjk) {
boundsMat->setLowerBound(i,j, diffLikUjk);
} else if (boundsMat->getLowerBound(i,j) < diffLjkUik) {
boundsMat->setLowerBound(i,j, diffLjkUik);
}
if (boundsMat->getLowerBound(i,j) > boundsMat->getUpperBound(i,j)) {
//std::cout << boundsMat->getLowerBound(i,j) << " " << boundsMat->getUpperBound(i,j) << "\n";
return false;
}
}
}
}
return true;
}
}
|
