NURBS求取basis函数的代码

// 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] *
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值