#include <SimpleConstraintPointMinimizer.h>
◆ SimpleConstraintPointMinimizer()
SimpleConstraintPointMinimizer::SimpleConstraintPointMinimizer |
( |
double |
proximity | ) |
|
◆ ~SimpleConstraintPointMinimizer()
SimpleConstraintPointMinimizer::~SimpleConstraintPointMinimizer |
( |
| ) |
|
◆ findMinimum()
Definition at line 27 of file SimpleConstraintPointMinimizer.cxx.
33 double delta1,delta2,delta3;
35 double retval_old = 100.0;
36 double retval_min = retval_old;
42 delta1=translate2.mag();
46 cout<<
" findMinimum: bad goodness step, > 10 un "<<endl;
57 translate+=translate2;
60 }
while ( (niterat<10) & ((delta1>0.00001)|(delta2>0.00001)) );
63 cout<<
" findMinimum: 10 iterations, not converging "<<endl;
66 cout<<
" findMinimum: bad goodness, not converging: "
67 <<
retval<<
" > "<<retval_min<<endl;
◆ secondMinimum()
Definition at line 79 of file SimpleConstraintPointMinimizer.cxx.
96 unsigned ipoint, ngood(0);
97 unsigned npoints = points.size();
99 for(ipoint=0;ipoint<
npoints;ipoint++){
107 translate2 += cPoint-sPoint;
121 translate2 *= 1.0/ngood;
125 for(ipoint=0;ipoint<
npoints;ipoint++){
134 theLcm += thePoint.cross(theDelta);
135 Vect[0] = thePoint.x();
136 Vect[1] = thePoint.y();
137 Vect[2] = thePoint.z();
139 Tens += thePoint.
mag2()*temp;
149 Vect[0] = theLcm.
x();
150 Vect[1] = theLcm.
y();
151 Vect[2] = theLcm.
z();
152 Rota= Tens.inverse() * Vect;
154 translate2 -= aRotat2.cross(wPoint);
157 translate2.setZero();
172 for(ipoint=0;ipoint<
npoints;ipoint++){
177 distsum += (
cur - sur).
mag();
183 retval = std::numeric_limits<double>::infinity();
◆ m_proximity
double SimpleConstraintPointMinimizer::m_proximity |
|
private |
The documentation for this class was generated from the following files: