Skip to content
Snippets Groups Projects
Select Git revision
  • master
  • develop
2 results

multi_indices.py

Blame
  • BezierCurve.m 575 B
    % function u = BezierCurve(P, t)
    % 
    % n = size(P,2);
    % for i=1:n
    %     for j=1:n-i
    %         P(:,j) = (1-t)*P(:,j) + t*P(:,j+1);
    %     end
    % end
    % u = P(:,1);
    % 
    % % n = length(ctrl_pt);
    % % u = 0;
    % %     for i = 1:n
    % %         u = 1; % compute return value. Write your code instead of 1.
    % %     end
    % end
    
    
    
    function u = BezierCurve(ctrl_pt, t)
    
    n = length(ctrl_pt);
    u = 0;
        for i = 1:n
            u = u + factorial(n-1)/(factorial(i-1) * factorial(n-i)) * t^(i-1)*(1-t)^(n-i)*ctrl_pt(i);
    %         u = u + ctrl_pt(i) * nchoosek(n,i) * (t^i .* (1-t).^(n-i));?
        end
    end