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

📄 hartleyj.java__.htm

📁 b样条算法 b样条算法 b样条算法
💻 HTM
字号:
<html><head><title>B-splin.rar - HartleyJ.java</title></head><body>
<script language="JavaScript">
function openwin(url)
{
 window.open(url, 'ProgramSourceCode');
}
</script>
<textarea cols=105 rows=17>文件头:
public class	HartleyJ

{

	public static void main(String[] args) 

	{

		double[][] d ={{-24,-12,1,10,12},{0,6,8,2,0}};

		int n=5;

		int k=3;

		double[] u=new double[n+k+1];

		HartleyJ H=new HartleyJ();

		u=H.Hartleyknot(d,n,k);

		

	    double[]  w=H.HartleyT(u,n,k);

		for(int i=0;i<w.length;i++)

			System.out.println(w[i]);

		for(int i=0;i<n+k+1;i++)

		System.out.println("U="+u[i]+"   ");

	}

	public  double sum(double[][] d,int n,int j)

	{

		double L=0;

		double[] l=new double[n];

		for(int i=n-1;i>j;i--)

		{

			l[i]=Math.sqrt((d[0][i]-d[0][i-1])*(d[0][i]-d[0][i-1])+(d[1][i]-d[1][i-1])*(d[1][i]-d[1][i-1]));

			L=L+l[i];

		}	

		return L;

	}

	public  double Sum(double[][] d,int k,int  n)

	{

		double Sum1=0;

		for(int i=k+1;i<=n;i++)

		{

			Sum1=Sum1+sum(d,i,i-k-1);

		}

		return Sum1;



	}

	public  double[] Hartleyknot(double[][] d,int n,int k)

	{ 

		double[] u=new double[n+k+1];

		double U=0;

		for(int j=0;j<=k;j++)

			u[j]=0;

		for(int i=k+1;i<=n</textarea><BR>
<table width=756 border=0>
<tr><td width=1 bgcolor=#B0B0B0></td><td>
<script type="text/javascript"><!--
google_ad_client = "pub-8055710228382273";
google_ad_width = 728;
google_ad_height = 90;
google_ad_format = "728x90_as";
google_ad_type = "text_image";
google_ad_channel ="";
google_color_border = "FFFFFF";
google_color_bg = "FFFFFF";
google_color_link = "000000";
google_color_text = "333333";
google_color_url = "666666";
//--></script>
<script type="text/javascript"
  src="http://pagead2.googlesyndication.com/pagead/show_ads.js">
</script>
</td>
<td width=15 bgcolor=#E4E0D8></td></tr></table>
<textarea cols=105 rows=12>文件尾:
-1;i++)

		{

			for(int j=k+1;j<=i;j++)

			{

				U=U+sum(d,j,j-k-1)/Sum(d,k,n);

			}

			u[i]=U;

		}

		for(int j=n;j<n+k+1;j++)

		{

			u[j]=1;

		}

		return u;

	}

	public double[] HartleyT(double[] u,int n,int k)

	{

		double[] w=new double[n-k-1+2];

		for(int i=0;i<w.length;i++)

			w[i]=u[i+k];

		return w;

	}



}

</textarea><BR>
<a href=http://www.pudn.com><small><font color=#A0A0A0>程序员联合开发网</font></small></a>&nbsp;&nbsp;<a href="/downloads76\sourcecode\java/detail282080.html"><small><font color=#A0A0A0>返回B-splin.rar</font></small></a>
&nbsp;&nbsp;<a href="javascript:openwin('/view_src.asp?id=282080&f=HartleyJ.java');"><small><font color=#A00000>在线阅读整个文件</font></small></a>
</body></html>

⌨️ 快捷键说明

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