|
5683
|
1 /* Copyright (C) 2009 Carlo de Falco |
|
|
2 |
|
6958
|
3 This program is free software: you can redistribute it and/or modify |
|
5683
|
4 it under the terms of the GNU General Public License as published by |
|
6958
|
5 the Free Software Foundation, either version 2 of the License, or |
|
5683
|
6 (at your option) any later version. |
|
6958
|
7 |
|
5683
|
8 This program is distributed in the hope that it will be useful, |
|
|
9 but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
10 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
11 GNU General Public License for more details. |
|
|
12 |
|
|
13 You should have received a copy of the GNU General Public License |
|
6958
|
14 along with this program. If not, see <http://www.gnu.org/licenses/>. |
|
5683
|
15 */ |
|
|
16 |
|
|
17 #include <octave/oct.h> |
|
|
18 #include <octave/oct-map.h> |
|
|
19 #include <octave/parse.h> |
|
|
20 #include "low_level_functions.h" |
|
|
21 |
|
|
22 DEFUN_DLD(nrb_srf_basisfun__, args, nargout,"\ |
|
|
23 NRB_SRF_BASISFUN__: Undocumented private function\ |
|
|
24 ") |
|
|
25 { |
|
|
26 |
|
|
27 octave_value_list retval, newargs; |
|
|
28 |
|
|
29 const NDArray points = args(0).array_value(); |
|
|
30 const Octave_map nrb = args(1).map_value(); |
|
|
31 |
|
|
32 if (!error_state) |
|
|
33 { |
|
|
34 |
|
|
35 const Cell knots = nrb.contents("knots")(0).cell_value(); |
|
|
36 const NDArray coefs = nrb.contents("coefs")(0).array_value(); |
|
|
37 octave_idx_type m = (nrb.contents("number")(0).vector_value())(0) - 1; // m = size (nrb.coefs, 2) -1; |
|
|
38 octave_idx_type n = (nrb.contents("number")(0).vector_value())(1) - 1; // n = size (nrb.coefs, 3) -1; |
|
|
39 octave_idx_type p = (nrb.contents("order")(0).vector_value())(0) - 1; // p = nrb.order(1) -1; |
|
|
40 octave_idx_type q = (nrb.contents("order")(0).vector_value())(1) - 1; // q = nrb.order(2) -1; |
|
|
41 |
|
8034
|
42 Array<idx_vector> idx(dim_vector (2, 1), idx_vector(':')); |
|
5787
|
43 idx(0) = 0; |
|
5683
|
44 const NDArray u(points.index (idx).squeeze ()); // u = points(1,:); |
|
|
45 |
|
5787
|
46 idx(0) = 1; |
|
5683
|
47 const NDArray v(points.index (idx).squeeze ()); // v = points(2,:); |
|
|
48 |
|
|
49 octave_idx_type npt = u.length (); // npt = length(u); |
|
|
50 RowVector M(p+1, 0.0), N (q+1, 0.0); |
|
|
51 Matrix RIkJk(npt, (p+1)*(q+1), 0.0); |
|
|
52 Matrix indIkJk(npt, (p+1)*(q+1), 0.0); |
|
|
53 RowVector denom(npt, 0.0); |
|
|
54 |
|
|
55 const RowVector U(knots(0).row_vector_value ()); // U = nrb.knots{1}; |
|
|
56 |
|
|
57 const RowVector V(knots(1).row_vector_value ()); // V = nrb.knots{2}; |
|
|
58 |
|
8034
|
59 Array<idx_vector> idx2(dim_vector (3, 1), idx_vector(':')); idx2(0) = 3; |
|
5683
|
60 NDArray w (coefs.index (idx2).squeeze ()); // w = squeeze(nrb.coefs(4,:,:)); |
|
|
61 |
|
|
62 RowVector spu(u); |
|
|
63 for (octave_idx_type ii(0); ii < npt; ii++) |
|
|
64 { |
|
|
65 spu(ii) = findspan(m, p, u(ii), U); |
|
|
66 } // spu = findspan (m, p, u, U); |
|
|
67 |
|
|
68 newargs(3) = U; newargs(2) = p; newargs(1) = u; newargs(0) = spu; |
|
|
69 Matrix Ik = feval (std::string("numbasisfun"), newargs, 1)(0).matrix_value (); // Ik = numbasisfun (spu, u, p, U); |
|
|
70 |
|
|
71 RowVector spv(v); |
|
|
72 for (octave_idx_type ii(0); ii < v.length(); ii++) |
|
|
73 { |
|
|
74 spv(ii) = findspan(n, q, v(ii), V); |
|
|
75 } // spv = findspan (n, q, v, V); |
|
|
76 |
|
|
77 newargs(3) = V; newargs(2) = q; newargs(1) = v; newargs(0) = spv; |
|
|
78 Matrix Jk = feval (std::string("numbasisfun"), newargs, 1)(0).matrix_value (); // Jk = numbasisfun (spv, v, q, V); |
|
|
79 |
|
|
80 Matrix NuIkuk(npt, p+1, 0.0); |
|
|
81 for (octave_idx_type ii(0); ii < npt; ii++) |
|
|
82 { |
|
|
83 basisfun (int(spu(ii)), u(ii), p, U, M); |
|
|
84 NuIkuk.insert (M, ii, 0); |
|
|
85 } // NuIkuk = basisfun (spu, u, p, U); |
|
|
86 |
|
|
87 Matrix NvJkvk(v.length (), q+1, 0.0); |
|
|
88 for (octave_idx_type ii(0); ii < npt; ii++) |
|
|
89 { |
|
|
90 basisfun(int(spv(ii)), v(ii), q, V, N); |
|
|
91 NvJkvk.insert (N, ii, 0); |
|
|
92 } // NvJkvk = basisfun (spv, v, q, V); |
|
|
93 |
|
|
94 |
|
|
95 for (octave_idx_type k(0); k < npt; k++) |
|
|
96 for (octave_idx_type ii(0); ii < p+1; ii++) |
|
|
97 for (octave_idx_type jj(0); jj < q+1; jj++) |
|
|
98 denom(k) += NuIkuk(k, ii) * NvJkvk(k, jj) * w(Ik(k, ii), Jk(k, jj)); |
|
|
99 |
|
|
100 |
|
|
101 for (octave_idx_type k(0); k < npt; k++) |
|
|
102 for (octave_idx_type ii(0); ii < p+1; ii++) |
|
|
103 for (octave_idx_type jj(0); jj < q+1; jj++) |
|
|
104 { |
|
|
105 RIkJk(k, octave_idx_type(ii+(p+1)*jj)) = NuIkuk(k, ii)*NvJkvk(k, jj) * w(Ik(k, ii), Jk(k, jj))/denom(k); |
|
|
106 indIkJk(k, octave_idx_type(ii+(p+1)*jj))= Ik(k, ii)+(m+1)*Jk(k, jj)+1; |
|
|
107 } |
|
|
108 |
|
|
109 // for k=1:npt |
|
|
110 // [Jkb, Ika] = meshgrid(Jk(k, :), Ik(k, :)); |
|
|
111 // indIkJk(k, :) = sub2ind([m+1, n+1], Ika(:)+1, Jkb(:)+1); |
|
|
112 // wIkaJkb(1:p+1, 1:q+1) = reshape (w(indIkJk(k, :)), p+1, q+1); |
|
|
113 |
|
|
114 // NuIkukaNvJkvk(1:p+1, 1:q+1) = (NuIkuk(k, :).' * NvJkvk(k, :)); |
|
|
115 // RIkJk(k, :) = (NuIkukaNvJkvk .* wIkaJkb ./ sum(sum(NuIkukaNvJkvk .* wIkaJkb)))(:).'; |
|
|
116 // end |
|
|
117 |
|
|
118 retval(0) = RIkJk; // B = RIkJk; |
|
|
119 retval(1) = indIkJk; // N = indIkJk; |
|
|
120 |
|
|
121 } |
|
|
122 return retval; |
|
|
123 } |
