CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - cutphoto
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - cutphoto - List
[
Fractal program
]
cutphoto
DL : 0
第一幅图被称作曼德勃罗特集,曼德勃罗特集的数学模型非常简单。假设有复数Z和μ,用下式迭代计算:Z=Z2+μ,由于μ的取值不同,经过若干次数迭代以后Z的幅值可能趋向无穷,也可能保持有界,曼德勃罗特集就是那些使Z保持有界的μ的集合,把μ在复平面上的分布作成图像,就像上面演示的那样具有极其复杂的结构。 假设屏幕的分辨率为640×480。 -section known as a map Mandebo Lott set Mandebo Lott episode is very simple mathematical model. Assuming that there is a plural Z and , with the following iterative calculation : Z = Z2 + , because the value of different , after several iteration number Z after the amplitude may tend to infinity. May also maintained sector, Mandebo Lott who is set to make Z maintained sector pool put on the complex plane make the distribution of images, as demonstrated above in the extremely complex structure. Assuming screen resolution of 640 480.
Date
: 2008-10-13
Size
: 3.59kb
User
:
飞机
[
Fractal program
]
cutphoto
DL : 0
第一幅图被称作曼德勃罗特集,曼德勃罗特集的数学模型非常简单。假设有复数Z和μ,用下式迭代计算:Z=Z2+μ,由于μ的取值不同,经过若干次数迭代以后Z的幅值可能趋向无穷,也可能保持有界,曼德勃罗特集就是那些使Z保持有界的μ的集合,把μ在复平面上的分布作成图像,就像上面演示的那样具有极其复杂的结构。 假设屏幕的分辨率为640×480。 -section known as a map Mandebo Lott set Mandebo Lott episode is very simple mathematical model. Assuming that there is a plural Z and , with the following iterative calculation : Z = Z2+ , because the value of different , after several iteration number Z after the amplitude may tend to infinity. May also maintained sector, Mandebo Lott who is set to make Z maintained sector pool put on the complex plane make the distribution of images, as demonstrated above in the extremely complex structure. Assuming screen resolution of 640 480.
Date
: 2025-07-01
Size
: 3kb
User
:
飞机
[
Other
]
cutphoto
DL : 0
用MATLAB编的一个可以剪切车牌号的小程序。-MATLAB can be compiled using a cut license plate number of small programs.
Date
: 2025-07-01
Size
: 44kb
User
:
李路通
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.