⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 class1.cs

📁 我写的仿射程序
💻 CS
字号:
using System;

namespace AffirmClassLibrary
{
	/// <summary>
	/// Class1 的摘要说明。
	/// </summary>
	public class Class1
	{
		public void affirm(double x1,double y1,double a, double b,double c,double d,double e,double f,out double x2,out double y2)
		{
			x2=x1*a+y1*b+c;
			y2=x1*d+y1*e+f;
		}


		private void fcan(double x1,double y1,double x2, double y2,double x3,double y3,double xx1, double xx2, double xx3,out double xa,out double xb,out double xc)
		{
			double[,] a;
			double[] x;

			a=new double[3,4];
			x=new double[3];

			double client,temp=0;
			int n=3 ;
            
			
			//输入Ax=b的A矩阵
			a[0,0]=x1;
			a[0,1]=y1;
			a[0,2]=a[1,2]=a[2,2]=1;
			a[1,0]=x2;
			a[1,1]=y2;
			a[2,0]=x3;
			a[2,1]=y3;
      
			//输入b向量
			a[0,3]=xx1;
			a[1,3]=xx2;
			a[2,3]=xx3;

			for(int k = 0; k < n - 1; k++)
			{
				for(int i = k + 1; i < n; i++)
				{
					client = a[i,k]/a[k,k];
					for( int j = k + 1; j < n; j++)
					{
						a[i,j] = a[i,j] - client * a[k,j]; 
					}
					a[i,n] = a[i,n] - client * a[k,n]; 
				}
			}
			a[n - 1,n] = a[n - 1,n]/a[n - 1,n - 1];	
			for(int i = n - 2; i >= 0; i--)
			{
				for (int j = i + 1; j < n; j++)
				{
					temp = temp + a[i,j] * a[j,n];
				}
				a[i,n] = (a[i,n] - temp) / a[i,i];
				temp=0;
			}
			xa=a[0,3];
			xb=a[1,3];
			xc=a[2,3];	
		}

		private void Affirm_Can(double x1,double y1,double x2, double y2,double x3,double y3,double xx1, double yy1,double xx2, double yy2,double xx3,double yy3,out double xa,out double xb,out double xc,out double xd,out double xe,out double xf)
		{
			double a,b,c,d,e,f;
			fcan( x1, y1, x2,  y2, x3, y3, xx1,  xx2,  xx3,out a,out b,out c);
			fcan( x1, y1, x2,  y2, x3, y3, yy1,  yy2,  yy3,out d,out e,out f);
			xa=a;
			xb=b;
			xc=c;
			xd=d;
			xe=e;
			xf=f;
		}

	}
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -