代码搜索:Koch

找到约 1,787 项符合「Koch」的源代码

代码结果 1,787
www.eeworm.com/read/191214/8433095

m koch.m

function koch(s,t,n) if size(s)~=size(t) disp('输入参数的维数必须相等'); else for j=1:n x=[]; y=[]; for i=1:length(s)-1 d1=s(i+1)-s(i); d2=t(i+1)-t(i); x1=s(i)+[0,d1/3
www.eeworm.com/read/290861/8457981

m koch.m

function [z,A]=Koch(z,A,n); % 递归法生成Koch曲线 % Example: % [z,A]=Koch(0,pi/2,0); % 算法见: % http://graphics.shu.edu.cn/course/fractal/program/p3-4-1-2.htm z=0;A=pi/2;n=0; N=4; % 递归次数
www.eeworm.com/read/388421/8611166

m koch.m

clear p=[0 0;10 0];n=1; A=[cos(pi/3) -sin(pi/3);sin(pi/3) cos(pi/3)]; for k=1:5 j=0; for i=1:n q1=p(i,:); q2=p(i+1,:); d=(q2-q1)/3; j=j+1;r(j,:
www.eeworm.com/read/386554/8738379

m koch.m

function f=Koch(ax,ay,bx,by,c) if (bx-ax)^2+(by-ay)^2
www.eeworm.com/read/365868/9842363

m koch.m

function koch(s,t,n) if size(s)~=size(t) disp('输入参数的维数必须相等'); else for j=1:n x=[]; y=[]; for i=1:length(s)-1 d1=s(i+1)-s(i); d2=t(i+1)-t(i); x1=s(i)+[0,d1/3
www.eeworm.com/read/356085/10237411

m koch.m

function koch(s,t,n) if size(s)~=size(t) disp('输入参数的维数必须相等'); else for j=1:n x=[]; y=[]; for i=1:length(s)-1 d1=s(i+1)-s(i); d2=t(i+1)-t(i); x1=s(i)+[0,d1/3
www.eeworm.com/read/160256/10548583

m koch.m

function koch(s,t,n) if size(s)~=size(t) disp('输入参数的维数必须相等'); else for j=1:n x=[]; y=[]; for i=1:length(s)-1 d1=s(i+1)-s(i); d2=t(i+1)-t(i); x1=s(i)+[0,d1/3
www.eeworm.com/read/464287/7166783

m koch.m

function koch(s,t,n) if size(s)~=size(t) disp('输入参数的维数必须相等'); else for j=1:n x=[]; y=[]; for i=1:length(s)-1 d1=s(i+1)-s(i); d2=t(i+1)-t(i); x1=s(i)+[0,d1/3
www.eeworm.com/read/439490/7707797

c koch.c

/* Bai tap 2_27 - Chuong trinh ve duong Koch */ #include #include #include /* he so doi tu do sang radian */ #define RADS 0.017453293 void Koch(int dir, doubl
www.eeworm.com/read/142282/12953011

m koch.m

%KOCH: Plots 'Koch Curve' Fractal % % koch(n) plots the 'Koch Curve' Fractal after n iterations % e.g koch(4) plots the Koch Curve after 4 iterations. % (be patient for n>8, depending on Computer