我有一组控制点
pts = [[849, 1181],
[916, 1257],
[993, 1305],
[1082,1270],
[1137,1181],
[1118,1055],
[993,1034],
[873,1061],
[849, 1181]]
我有生成开放结向量的逻辑:
/*
Subroutine to generate a B-spline open knot vector with multiplicity
equal to the order at the ends.
c = order of the basis function
n = the number of defining polygon vertices
nplus2 = index of x() for the first occurence of the maximum knot vector value
nplusc = maximum value of the knot vector -- $n + c$
x() = array containing the knot vector
*/
knot(n,c,x)
int n,c;
int x[];
{
int nplusc,nplus2,i;
nplusc = n + c;
nplus2 = n + 2;
x[1] = 0;
for (i = 2; i <= nplusc; i++){
if ( (i > c) && (i < nplus2) )
x[i] = x[i-1] + 1;
else
x[i] = x[i-1];
}
}
另一个用于生成周期性节点向量:
/* Subroutine to generate a B-spline uniform (periodic) knot vector.
c = order of the basis function
n = the number of defining polygon vertices
nplus2 = index of x() for the first occurence of the maximum knot vector value
nplusc = maximum value of the knot vector -- $n + c$
x[] = array containing the knot vector
*/
#include <stdio.h>
knotu(n,c,x)
int n,c;
int x[];
{
int nplusc,nplus2,i;
nplusc = n + c;
nplus2 = n + 2;
x[1] = 0;
for (i = 2; i <= nplusc; i++){
x[i] = i-1;
}
}
然而,我需要在 [0,1] 范围内生成一个非均匀的节点向量
上述算法产生统一的节点向量。
请建议是否有任何方法可以做到这一点。如果代码在python中会更好