# include <stdio.h>
# include <math.h>
# include <string.h>
# include <stdlib.h>
# define N 30
//double th0=2.182;
//double ph0=1.658;
double l=4.0;
int main(void)
{
int i, j, k, m, n;
double x[N], y[N], z[N];
double A, B, C;
double L[7], D[6], SW[7], CW[7], PH[6],APH[6], TPH=0;
FILE *fp;
//for(j=1;j<=NX;j++)
//{
printf("k=");
scanf("%d",&k);
sprintf(Istring,"snp%d",k);
fp=fopen(Istring,"r");
for(i=0;i<N;i++)
{
fscanf(fp,"%lf %lf %lf",&x[i],&y[i],&z[i]);
}
fclose(fp);
A=((y[6]+y[2])/2-y[4])*((z[4]+z[0])/2-z[2])-((y[4]+y[0])/2-y[2])*((z[6]+z[2])/2-z[4]);
B=((x[4]+x[0])/2-x[2])*((z[6]+z[2])/2-z[4])-((x[6]+x[2])/2-x[4])*((z[4]+z[0])/2-z[2]);
C=((x[6]+x[2])/2-x[4])*((y[4]+y[0])/2-y[2])-((y[6]+y[2])/2-y[4])*((x[4]+x[0])/2-x[2]);
for(i=0;i<29;i++)
{
L[i]=sqrt((x[i+1]-x[i])*(x[i+1]-x[i])+(y[i+1]-y[i])*(y[i+1]-y[i])+(z[i+1]-z[i])*(z[i+1]-z[i]));
}
for(j=0;j<6;j++)
{
D[j]=sqrt((x[j+2]-x[j])*(x[j+2]-x[j])+(y[j+2]-y[j])*(y[j+2]-y[j])+(z[j+2]-z[j])*(z[j+2]-z[j]));
}
for(k=0;k<7;k++)
{
SW[k]=(fabs(A*(x[k+1]-x[k])+B*(y[k+1]-y[k])+C*(z[k+1]-z[k])))/(sqrt(A*A+B*B+C*C))/L[k];
}
for(m=0;m<7;m++)
{
CW[m]=sqrt(1-SW[m]*SW[m]);
}
for(n=0;n<6;n++)
{
PH[n]=(L[n]*L[n]+L[n+1]*L[n+1]+2*L[n]*L[n+1]*SW[n]*SW[n+1]-D[n]*D[n])/(2*L[n]*L[n+1]*CW[n]*CW[n+1]);
APH[n]=acos(PH[n]);
APH[n]=acos(-1.)-APH[n];
}
TPH=APH[0]+APH[1]+APH[2]+APH[3]+APH[4]+APH[5];
printf("TPH:%lf %lf\n",TPH,TPH*180/acos(-1.));
return 0;
}
C语言——一些处理脚本(11)——(待完善)
最新推荐文章于 2024-05-06 14:30:16 发布