搜索资源列表
tierazon-2.5-source
- 从信息和功能分形的观点来看DNA 是一个分形体内部包含着不同 层次的DNA 复制仅是信息和功能分形的显现相当于把一个具有无 穷层次的DNA 分形体进行分解或放大信息分形的含义是体系 的局部包含着整体的主要信息-from information and functional Fractal point of view DNA is a breakdown of internal body contains different levels of DNA replication is t
tierazon-2.8-source
- 分维<Df>的大小不仅反应遗传语言词汇结构的变 化而且反应遗传语言语法关系的清晰程度即序列中碱基的相关程度 关联作用会使<Df>增大在<Df>小于2 的区间内遗
CalFraDim
- 一个利用尺度法和测度法快速计算一般分形图形分形维数的程序，只能处理bmp格式的分形图形，但是速度很快-use a yardstick and measure law Rapid Calculation general fractal graphics fractal dimension of the process, can only handle bmp format of the fractal graphics, but speed
fi_treegen10
- vc++ opengl实践分形树 可更改许多的条件 使树木发生变化-vc opengl practice fractal tree to alter the conditions in which many of the trees change
graphics_fenxing
- 主要模拟了荡漾的水面，使用的方法是：随机给定矩形水面四个角的高度，用随机中点位移法生成一幅分形水面，然后使水波按照一定的传播机制扩散、衰减，从而模拟出水波荡漾的效果。-simulated a ripple on the surface, the methods used are : to set random four corners of the rectangular surface and with a random midpoint displacement method generat
The-Curve-Of-Koch
- 本实例主要是利用递归的方法以及MFC工具来三分Koch曲线，主要由子函数paint来实现，通过修改其n值可以得到想要递归的次数-example is the use of recursive methods and tools to third MFC Koch curve, mainly by Functions paint to achieve through revising its value n want to be the number of recursive
xiaobofenxing3
- 小波分形的一个程序，算法不错，也很容易看懂。-Wavelet Fractal a procedure, the algorithm good, and very easy to understand.
VB39zhongdonghua
- 基于VB编程算法的39种动画效果,类似屏保 -VB programming algorithm based on the 39 kinds of animation effects, similar to a screensaver
fengchuifenxing
- 风吹分形树：本例采用WIN32 + 字符替换法 模拟从2阶到N阶 经典分形树的实现。而经典的算法采用递归实现。 其中的字符替换法 可作为此类问题的通解-wind fractal tree : the characters WIN32 cases using replacement simulation from two bands of N-classic fractal tree realized. The classic recursive algorithm to achieve. T
huishufenxing
- 桧树分形小枝:win32+GDI+分形算法；经典课程例子的vc++实例-cypress trees Fractal branchlets : win32 GDI fractal algorithm; Classic examples of courses example vc
weizeke
- 维则克方块：黑白递归调用。这是小弟学分形学是做的VC++ WIN32+GDI 编程；-peacekeeping grams squares were : black and white recursive call. This is the brother-credit study is done VC WIN32 GDI programming;
treedd
- 使用WINDOWS GDI和VC++6.0来实现构造一棵分形树,可以通过改变树的N值来改变树的形态-use Windows GDI and VC 6.0 constructed to achieve a fractal tree, trees can change the value of N to change the form of the tree
canto
- 利用分形递归算法实现Cantor三分集，实现有限次迭代！-use fractal recursive algorithm Cantor third set and achieve limited iterations!
Arboresent
- 利用分形算法中的迭代和递归生成Arboresent肺形曲线，效果好！-fractal algorithm using the iterative and recursive generation Arboresent lung-shaped curve, the effect!
Sierpinski_1
- 本程序利用迭代递归算法实现，可以画出正三角形构成的Sierpinski垫片，输入条件为正三角形的中心坐标和边长。-the iterative procedure recursive algorithm, sense regular triangle constitutes the Sierpinski gasket, import conditions for the regular triangle coordinates of the center and side length.
seripinski_2
- 本程序利用迭代递归算法可以绘制任意三角形的Sierpinski垫片，包括不是正三角形的，输入条件为三角形三个顶点的坐标。-the iterative procedure recursive algorithm can draw arbitrary triangular Sierpinski gasket, not including the regular triangle, the conditions for the importation of three vertices of the
sierpinski_dt
- 利用分形中的迭代和递归算法实现Sierpinski地毯，程序简单易懂，改动程序中的n值即可控制递归次数。-use fractal iterative and recursive algorithm Sierpinski gasket, procedures simplified, changes to the procedures used for the control of n number of recursive.
peano_trangle
- 把利用递归法绘制的三条Hilbert-Peano曲线变换角度，首尾相接，构成一个Hilbert-Peano笼！-recursive method of using the three mapping Hilbert - Peano transform angle curve, back-to-back. constitute a Hilbert - Peano cage!
2_C
- 利用90度角支撑迭代递归算法绘制C曲线，简单易懂！-use of 90 degree angle support recursive iterative algorithm mapping C curve, simple!
DolbySOphia
- 分形中的L系统生成的实现。对于研究图形图像的分形几何入门者有一定帮助吧-fractal generation of L system achieved. Graphic images for the study of fractal geometry beginners will definitely help it