C++ (Cpp) VectorAngle 예제들

예제 #1

0

파일 보기

파일: bullet.cpp 프로젝트: hardbird/PlaneWars_by_cpp

void Bullet::moveto(QPoint pos){
	QPoint a = getSpeedVector(), b = pos - getCurPostion();
	double alength = VectorLength(a), blength = VectorLength(b);
	double rad;
	if (VectorCross(a, b) <= 0){
		rad = VectorAngle(a, b) / acos(-1.0) * 180.0;
	}
	else{
		rad = -VectorAngle(a, b) / acos(-1.0) * 180.0;
	}
	a = b * alength / blength;
	setSpeedVector(a);
	lastPos = lastPos + getSpeedVector();
}

예제 #2

0

파일 보기

파일: Tree.cpp 프로젝트: rhinophile/FoRM-Windows

double CalcSVF(double xs, double ys,double Beta, double TreeHeight, double TreeInterval, double rc){

	struct VecPoint T0,T1,T2,T3;
	struct VecPoint I0,I1,I2,I3;
	struct VecPoint S;

	double Gamma0;
	double Gamma1;
	double Gamma2;
	double Gamma3;
	double svf;

	if((xs==0)&&(ys==0)){
		xs=1e-36;
		ys=1e-36;
	}
	Beta=Beta*Pi180;
	S.x=xs; S.y=ys* cos(Beta); S.z=ys* sin(Beta);//(*Point on the ground*);

	T0.x= 0; T0.y=0;T0.z= 0;//(*Tree 0*)
	T1.x= TreeInterval; T1.y=0;T1.z= 0;//(*Tree 1*)
	T2.x= TreeInterval;T2.y= TreeInterval*cos(Beta);T2.z= TreeInterval *sin(Beta);//(*Tree 2*)
	T3.x=0; T3.y=TreeInterval* cos(Beta); T3.z=TreeInterval* sin(Beta);//(*Tree 3*)

	I0.x =rc *cos(atan(ys *cos(Beta)/xs));
	I0.y =  rc *sin(atan(ys* cos(Beta)/xs));
	I0.z =  TreeHeight;//(*Point on Top of the tree, *)

	I1.x = TreeInterval - rc *cos(atan(ys *cos(Beta)/(TreeInterval- xs)));
	I1.y =  rc *sin(atan(ys* cos(Beta)/(TreeInterval - xs)));
	I1.z =  TreeHeight;

	I2.x = TreeInterval - rc *cos(atan((TreeInterval - ys) *cos(Beta)/(TreeInterval - xs)));
	I2.y = TreeInterval- rc *sin(atan((TreeInterval - ys)* cos(Beta)/(TreeInterval - xs)));
	I2.z = TreeInterval *sin(Beta) + TreeHeight;

	I3.x = rc* cos(atan((TreeInterval - ys) *cos(Beta)/(xs)));
	I3.y =TreeInterval - rc *sin(atan((TreeInterval - ys) *cos(Beta)/(xs)));
	I3.z =TreeInterval *sin(Beta) + TreeHeight;

	Gamma0 = VectorAngle(Vector(S, I0), Vector(T0, S)) - Pi/2;
	Gamma1 = VectorAngle(Vector(S, I1), Vector(T1, S)) - Pi/2;
	Gamma2 = VectorAngle(Vector(S, I2), Vector(T2, S)) - Pi/2;
	Gamma3 = VectorAngle(Vector(S, I3), Vector(T3, S)) - Pi/2;

	svf = (Gamma0 + Gamma1 + Gamma2 + Gamma3)/(2* Pi);

return svf;
}

예제 #3

0

파일 보기

파일: bullet.cpp 프로젝트: hardbird/PlaneWars_by_cpp

void Bullet::Paint(QPainter * painter, QRect){

	QPoint a(0, -10), b = this->speed;
	double rad;
	if (VectorCross(a, b) <= 0){
		rad = VectorAngle(a, b) / acos(-1.0) * 180.0;
	}
	else{
		rad = -VectorAngle(a, b) / acos(-1.0) * 180.0;
	}

	QPixmap tmpImg = img;
	QTransform transformed;
	transformed.rotate(-rad);
	painter->drawPixmap(getCurPostion() - QPoint(width() / 2, height() / 2), img.transformed(transformed));
}

예제 #4

0

파일 보기

파일: vectormath.cpp 프로젝트: eajfpeters/OBForceField

  /* Calculate the angle between point a and the plane determined by b,c,d */
  double Point2PlaneAngle(const Eigen::Vector3d& a, const Eigen::Vector3d& b, 
      const Eigen::Vector3d& c, const Eigen::Vector3d& d)
  {
    Eigen::Vector3d ac, bc, cd, normal;
    double angle;

    ac = a - c;
    bc = b - c;
    cd = c - d;
 
    normal = bc.cross(cd);
    angle = 90.0 - VectorAngle(normal, ac);

    return angle;
  }

예제 #5

0

파일 보기

파일: Tree.cpp 프로젝트: rhinophile/FoRM-Windows

double SVFNPoints(double xs, double ys,double Beta, double TreeHeight, double TreeInterval, double rc,int N){

	struct VecPoint T[49],I[49],S; 
	double Gamma[49];
	double SVF=0;
	
	if((xs==0)&&(ys==0)){
		xs=1e-36;
		ys=1e-36;
	}

	double TreeIntervalCosBeta=TreeInterval*cos(Beta*Pi180);
	double TreeIntervalSinBeta=TreeInterval*sin(Beta*Pi180);

	S.x=xs;	
	S.y=ys* cos(Beta*Pi180);		
	S.z=ys* sin(Beta*Pi180);				//(*Point on the ground*);
	
	int Counter=0;
	for(int i=-N;i<=N;i++){
		for(int j=-N;j<=N;j++){
			
			T[Counter].x=i*TreeInterval;
			T[Counter].y=j*TreeIntervalCosBeta;
			T[Counter].z=j*TreeIntervalSinBeta;
			
			I[Counter].x=T[Counter].x+rc*(S.x-T[Counter].x)/sqrt((S.x-T[Counter].x)*(S.x-T[Counter].x)+(S.y-T[Counter].y)*(S.y-T[Counter].y));
			I[Counter].y=T[Counter].y+rc*(S.y-T[Counter].y)/sqrt((S.x-T[Counter].x)*(S.x-T[Counter].x)+(S.y-T[Counter].y)*(S.y-T[Counter].y));
			I[Counter].z=T[Counter].z+TreeHeight;

			Gamma[Counter]=Pi/2-VectorAngle(Vector(S, I[Counter]), Vector(S,T[Counter]));
			SVF=SVF+Gamma[Counter]/((2*N+1)*(2*N+1)*Pi/2);
			Counter++;
		}
	}

	SVF=min(max(SVF,0),1);
	return SVF;
}

예제 #6

0

파일 보기