// NurbsBasis.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include <stdio.h>
#include <iostream>
using namespace std;
int FindSpan(int n,int p,double u,double *U)
{
if (u == U[n+1]) return n;
int low = p; int high = n+1;
int mid = (low+high)/2;
while (u < U[mid] || u >= U[mid+1]) {
if (u < U[mid]) high = mid;
else low = mid;
mid = (low+high)/2;
}
return mid;
}
void BasisFuns(int i, double u, int p, double *U, double *N)
{
double saved = 0.0,temp = 0.0;
double* left = new double[ p + 1 ];
double* right = new double[ p + 1 ];
N[0] = 1.0;
for( int j = 1; j <= p; j++ )
{
left[ j ] = u - U[ i + 1- j ];
right[ j ] = U[i + j ] - u;
saved = 0.0;
for( int r = 0; r < j; r++ )
{
// Lower triangle
temp = right[ r + 1 ] + left[ j - r ];
temp = N[r] / temp;
// Upper triangle
N[ r ] = saved + right[ r + 1 ]*temp;
saved = left[ j - r ] * temp;
}
N[ j ] = saved;
}
}
void DersBasisFuns( int i, double u, int p, int n, double* U, double ** & ders )
{
// Compute nonzero basis functions and their
// derivatives. First section is A2.2 modified
// to store functions and knot differences
// Input: i, u, p, n, U
// Output: ders
double saved,temp;
double ** ndu;
double ** a;
// Set up a [p+1] *
//
#include "stdafx.h"
#include <stdio.h>
#include <iostream>
using namespace std;
int FindSpan(int n,int p,double u,double *U)
{
if (u == U[n+1]) return n;
int low = p; int high = n+1;
int mid = (low+high)/2;
while (u < U[mid] || u >= U[mid+1]) {
if (u < U[mid]) high = mid;
else low = mid;
mid = (low+high)/2;
}
return mid;
}
void BasisFuns(int i, double u, int p, double *U, double *N)
{
double saved = 0.0,temp = 0.0;
double* left = new double[ p + 1 ];
double* right = new double[ p + 1 ];
N[0] = 1.0;
for( int j = 1; j <= p; j++ )
{
left[ j ] = u - U[ i + 1- j ];
right[ j ] = U[i + j ] - u;
saved = 0.0;
for( int r = 0; r < j; r++ )
{
// Lower triangle
temp = right[ r + 1 ] + left[ j - r ];
temp = N[r] / temp;
// Upper triangle
N[ r ] = saved + right[ r + 1 ]*temp;
saved = left[ j - r ] * temp;
}
N[ j ] = saved;
}
}
void DersBasisFuns( int i, double u, int p, int n, double* U, double ** & ders )
{
// Compute nonzero basis functions and their
// derivatives. First section is A2.2 modified
// to store functions and knot differences
// Input: i, u, p, n, U
// Output: ders
double saved,temp;
double ** ndu;
double ** a;
// Set up a [p+1] *