Mercurial > forge
view extra/nurbs/src/nrb_srf_basisfun_der__.cc @ 12672:59e8aae64812 octave-forge
prepare for release
author | cdf |
---|---|
date | Mon, 17 Aug 2015 10:23:44 +0000 |
parents | 27ae5ff9ec05 |
children |
line wrap: on
line source
/* Copyright (C) 2009 Carlo de Falco This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see <http://www.gnu.org/licenses/>. */ #include <octave/oct.h> #include <octave/oct-map.h> #include <octave/parse.h> #include "low_level_functions.h" DEFUN_DLD(nrb_srf_basisfun_der__, args, nargout,"\ NRB_SRF_BASISFUN_DER__: Undocumented private function \ ") { //function [Bu, Bv, N] = nrb_srf_basisfun_der__ (points, nrb); octave_value_list retval, newargs; const NDArray points = args(0).array_value(); const octave_scalar_map nrb = args(1).scalar_map_value(); if (!error_state) { const Cell knots = nrb.contents("knots").cell_value(); const NDArray coefs = nrb.contents("coefs").array_value(); octave_idx_type m = static_cast<octave_idx_type> ((nrb.contents("number").vector_value())(0)) - 1; // m = size (nrb.coefs, 2) -1; octave_idx_type n = static_cast<octave_idx_type> ((nrb.contents("number").vector_value())(1)) - 1; // n = size (nrb.coefs, 3) -1; octave_idx_type p = static_cast<octave_idx_type> ((nrb.contents("order").vector_value())(0)) - 1; // p = nrb.order(1) -1; octave_idx_type q = static_cast<octave_idx_type> ((nrb.contents("order").vector_value())(1)) - 1; // q = nrb.order(2) -1; Array<idx_vector> idx(dim_vector (2, 1), idx_vector(':')); idx(0) = 0; const NDArray u(points.index (idx).squeeze ()); // u = points(1,:); idx(0) = 1; const NDArray v(points.index (idx).squeeze ()); // v = points(2,:); octave_idx_type npt = u.numel (); // npt = length(u); RowVector M(p+1, 0.0), N (q+1, 0.0); Matrix Nout(npt, (p+1)*(q+1), 0.0); Matrix Bu(npt, (p+1)*(q+1), 0.0); Matrix Bv(npt, (p+1)*(q+1), 0.0); RowVector Denom(npt, 0.0); RowVector Denom_du(npt, 0.0); RowVector Denom_dv(npt, 0.0); Matrix Num(npt, (p+1)*(q+1), 0.0); Matrix Num_du(npt, (p+1)*(q+1), 0.0); Matrix Num_dv(npt, (p+1)*(q+1), 0.0); const RowVector U(knots(0).row_vector_value ()); // U = nrb.knots{1}; const RowVector V(knots(1).row_vector_value ()); // V = nrb.knots{2}; Array<idx_vector> idx2(dim_vector (3, 1), idx_vector(':')); idx2(0) = 3; NDArray w (coefs.index (idx2).squeeze ()); // w = squeeze(nrb.coefs(4,:,:)); RowVector spu(u); for (octave_idx_type ii(0); ii < npt; ii++) { spu(ii) = findspan(m, p, u(ii), U); } // spu = findspan (m, p, u, U); newargs(3) = U; newargs(2) = p; newargs(1) = u; newargs(0) = spu; Matrix Ik = feval (std::string("numbasisfun"), newargs, 1)(0).matrix_value (); // Ik = numbasisfun (spu, u, p, U); RowVector spv(v); for (octave_idx_type ii(0); ii < v.numel (); ii++) { spv(ii) = findspan(n, q, v(ii), V); } // spv = findspan (n, q, v, V); newargs(3) = V; newargs(2) = q; newargs(1) = v; newargs(0) = spv; Matrix Jk = feval (std::string("numbasisfun"), newargs, 1)(0).matrix_value (); // Jk = numbasisfun (spv, v, q, V); Matrix NuIkuk(npt, p+1, 0.0); for (octave_idx_type ii(0); ii < npt; ii++) { basisfun (int(spu(ii)), u(ii), p, U, M); NuIkuk.insert (M, ii, 0); } // NuIkuk = basisfun (spu, u, p, U); Matrix NvJkvk(v.numel (), q+1, 0.0); for (octave_idx_type ii(0); ii < npt; ii++) { basisfun(int(spv(ii)), v(ii), q, V, N); NvJkvk.insert (N, ii, 0); } // NvJkvk = basisfun (spv, v, q, V); newargs(4) = 1; newargs(3) = U; newargs(2) = u; newargs(1) = p; newargs(0) = spu; NDArray NuIkukprime = feval (std::string("basisfunder"), newargs, 1)(0).array_value (); // NuIkukprime = basisfunder (spu, p, u, U, 1); // NuIkukprime = squeeze(NuJkukprime(:,2,:)); newargs(4) = 1; newargs(3) = V; newargs(2) = v; newargs(1) = q; newargs(0) = spv; NDArray NvJkvkprime = feval (std::string("basisfunder"), newargs, 1)(0).array_value (); // NvJkvkprime = basisfunder (spv, q, v, V, 1); // NvJkvkprime = squeeze(NvJkvkprime(:,2,:)); for (octave_idx_type k(0); k < npt; k++) for (octave_idx_type ii(0); ii < p+1; ii++) for (octave_idx_type jj(0); jj < q+1; jj++) { Num(k, ii+jj*(p+1)) = NuIkuk(k, ii) * NvJkvk(k, jj) * w(static_cast<octave_idx_type> (Ik(k, ii)), static_cast<octave_idx_type> (Jk(k, jj))); Denom(k) += Num(k, ii+jj*(p+1)); Num_du(k, ii+jj*(p+1)) = NuIkukprime(k, 1, ii) * NvJkvk(k, jj) * w(static_cast<octave_idx_type> (Ik(k, ii)), static_cast<octave_idx_type> (Jk(k, jj))); Denom_du(k) += Num_du(k, ii+jj*(p+1)); Num_dv(k, ii+jj*(p+1)) = NuIkuk(k, ii) * NvJkvkprime(k, 1, jj) * w(static_cast<octave_idx_type> (Ik(k, ii)), static_cast<octave_idx_type> (Jk(k, jj))); Denom_dv(k) += Num_dv(k, ii + jj * (p+1)); } for (octave_idx_type k(0); k < npt; k++) for (octave_idx_type ii(0); ii < p+1; ii++) for (octave_idx_type jj(0); jj < q+1; jj++) { Bu(k, octave_idx_type(ii+(p+1)*jj)) = (Num_du(k, ii+jj*(p+1))/Denom(k) - Denom_du(k)*Num(k, ii+jj*(p+1))/(Denom(k)*Denom(k))); Bv(k, octave_idx_type(ii+(p+1)*jj)) = (Num_dv(k, ii+jj*(p+1))/Denom(k) - Denom_dv(k)*Num(k, ii+jj*(p+1))/(Denom(k)*Denom(k))); Nout(k, octave_idx_type(ii+(p+1)*jj))= Ik(k, ii)+(m+1)*Jk(k, jj)+1; } // for k=1:npt // [Ika, Jkb] = meshgrid(Ik(k, :), Jk(k, :)); // N(k, :) = sub2ind([m+1, n+1], Ika(:)+1, Jkb(:)+1); // wIkaJkb(1:p+1, 1:q+1) = reshape (w(N(k, :)), p+1, q+1); // Num = (NuIkuk(k, :).' * NvJkvk(k, :)) .* wIkaJkb; // Num_du = (NuIkukprime(k, :).' * NvJkvk(k, :)) .* wIkaJkb; // Num_dv = (NuIkuk(k, :).' * NvJkvkprime(k, :)) .* wIkaJkb; // Denom = sum(sum(Num)); // Denom_du = sum(sum(Num_du)); // Denom_dv = sum(sum(Num_dv)); // Bu(k, :) = (Num_du/Denom - Denom_du.*Num/Denom.^2)(:).'; // Bv(k, :) = (Num_dv/Denom - Denom_dv.*Num/Denom.^2)(:).'; // end retval(2) = Nout; retval(1) = Bv; retval(0) = Bu; } return retval; }