[ kepler | Source | Keywords | Summary | Ancestors | All Members | Descendants ]
Back to the top of edgeBound
edgeBound contains a few functions that did not belong anywhere else.
Back to the top of edgeBound
Back to the top of edgeBound
int shortDiagMax (double x0min,double x0pmin,double x1,double x2,double x3min, double& x3max,double x4,double x4p,double x5,double x5p);
Computes the Maximum of the shorter
diagonal if possible, assuming that the shorter diagonal is
the one joining the two simplices A and B.
There are two simplices
A = (x0min,x1,x2,x3,x4,x5), B=(x0pmin,x1,x2,x3,x4p,x5p);
They share vertices x1,x2,x3;
Assume edge3 is the shorter diagonal. Compute an upper bound
on this shorter diagonal.
We assume that the edge length belongs to [x3min,x3max(inputvalue)]
A revised x3max(output) is set, with x3max(output)<=x3max(input).
static int shortDiagMax (double x0min,double x0pmin,double x1,double x2,double x3min, double& x3max,double x4,double x4p,double x5,double x5p);
Back to the top of edgeBound
int x4_upper_from_dih_upper(const double x[6],const double z[6], double dih_upper, double& new_x4_upper);
given upper bound theta on dih, find corresponding upper bd on x4.
static int x4_upper_from_dih_upper(const double x[6],const double z[6], double dih_upper, double& new_x4_upper);
Back to the top of edgeBound
double chi234min(const domain&, const domain&);
lower bound on chi234. This has only been implemented
when the face(2,3,4) is acute.
static double chi234min(const domain&, const domain&); // for acute guys only
Back to the top of edgeBound
Back to the top of edgeBound
Back to the top of edgeBound
Back to the top of edgeBound
Report problems to jkotula@unimax.com