本文整理汇总了C++中RS_VectorSolutions::alloc方法的典型用法代码示例。如果您正苦于以下问题：C++ RS_VectorSolutions::alloc方法的具体用法？C++ RS_VectorSolutions::alloc怎么用？C++ RS_VectorSolutions::alloc使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类RS_VectorSolutions的用法示例。
在下文中一共展示了RS_VectorSolutions::alloc方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: getIntersectionEllipseEllipse
//.........这里部分代码省略.........
//double v1= v6 - v9;
double u0 = v4*v4-v2*mb10;
double u1 = 2.*(v3*v4-v0*mb10);
double u2 = 2.*(v4*v1-ma101*v0)+v3*v3+0.5*v2*v8;
double u3 = v0*v8+2.*v3*v1;
double u4 = v1*v1+2.*ma101*ma011*v0;
//std::cout<<"u0="<<u0<<"\tu1="<<u1<<"\tu2="<<u2<<"\tu3="<<u3<<"\tu4="<<u4<<std::endl;
//std::cout<<"("<<u4<<")*x^4+("<<u3<<")*x^3+("<<u2<<")*x^2+("<<u1<<")*x+("<<u0<<")=0\n";
double ce[4];
double roots[4];
unsigned int counts=0;
if ( fabs(u4) < 1.0e-75) { // this should not happen
if ( fabs(u3) < 1.0e-75) { // this should not happen
if ( fabs(u2) < 1.0e-75) { // this should not happen
if( fabs(u1) > 1.0e-75) {
counts=1;
roots[0]=-u0/u1;
} else { // can not determine y. this means overlapped, but overlap should have been detected before, therefore return empty set
return ret;
}
} else {
ce[0]=u1/u2;
ce[1]=u0/u2;
//std::cout<<"ce[2]={ "<<ce[0]<<' '<<ce[1]<<" }\n";
counts=RS_Math::quadraticSolver(ce,roots);
}
} else {
ce[0]=u2/u3;
ce[1]=u1/u3;
ce[2]=u0/u3;
//std::cout<<"ce[3]={ "<<ce[0]<<' '<<ce[1]<<' '<<ce[2]<<" }\n";
counts=RS_Math::cubicSolver(ce,roots);
}
} else {
ce[0]=u3/u4;
ce[1]=u2/u4;
ce[2]=u1/u4;
ce[3]=u0/u4;
//std::cout<<"ce[4]={ "<<ce[0]<<' '<<ce[1]<<' '<<ce[2]<<' '<<ce[3]<<" }\n";
counts=RS_Math::quarticSolver(ce,roots);
}
// std::cout<<"Equation for y: y^4";
// for(int i=3; i>=0; i--) {
// std::cout<<"+("<<ce[3-i]<<")";
// if ( i ) {
// std::cout<<"*y^"<<i;
// }else {
// std::cout<<" ==0\n";
// }
// }
if (! counts ) { // no intersection found
return ret;
}
// std::cout<<"counts="<<counts<<": ";
// for(unsigned int i=0;i<counts;i++){
// std::cout<<roots[i]<<" ";
// }
// std::cout<<std::endl;
RS_VectorSolutions vs0(8);
unsigned int ivs0=0;
for(unsigned int i=0; i<counts; i++) {
double y=roots[i];
//double x=(ma100*(ma011*y*y-1.)-ma000*(ma111*y*y+mb11*y+mc1))/(ma000*(2.*ma101*y+mb11));
double x,d=v0*y+v2;
// std::cout<<"d= "<<d<<std::endl;
if( fabs(d)>RS_TOLERANCE*sqrt(RS_TOLERANCE)) {//whether there's x^1 term in bezout determinant
x=-((v1*y+v3)*y+v4 )/d;
if(vs0.getClosestDistance(RS_Vector(x,y),ivs0)>RS_TOLERANCE)
vs0.set(ivs0++, RS_Vector(x,y));
} else { // no x^1 term, have to use x^2 term, then, have to check plus/minus sqrt
x=a1*sqrt(1-y*y*ma011);
if(vs0.getClosestDistance(RS_Vector(x,y),ivs0)>RS_TOLERANCE)
vs0.set(ivs0++, RS_Vector(x,y));
x=-x;
if(vs0.getClosestDistance(RS_Vector(x,y),ivs0)>RS_TOLERANCE)
vs0.set(ivs0++, RS_Vector(x,y));
}
//std::cout<<"eq1="<<ma000*x*x+ma011*y*y-1.<<std::endl;
//std::cout<<"eq2="<<ma100*x*x + 2.*ma101*x*y+ma111*y*y+mb10*x+mb11*y+mc1<<std::endl;
// if (
// fabs(ma100*x*x + 2.*ma101*x*y+ma111*y*y+mb10*x+mb11*y+mc1)< RS_TOLERANCE
// ) {//found
// vs0.set(ivs0++, RS_Vector(x,y));
// }
}
// for(unsigned int j=0; j<vs0.getNumber(); j++) {
// std::cout<<" ( "<<vs0.get(j).x<<" , "<<vs0.get(j).y<<" ) ";
// }
// std::cout<<std::endl;
// std::cout<<"counts= "<<counts<<"\tFound "<<ivs0<<" EllipseEllipse intersections\n";
ret.alloc(ivs0);
for(unsigned i=0; i<ivs0; i++) {
RS_Vector vp=vs0.get(i);
vp.rotate(-shifta1);
vp.move(-shiftc1);
ret.set(i,vp);
}
return ret;
}