搜索资源列表
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
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
canto
- 利用分形递归算法实现Cantor三分集，实现有限次迭代！-use fractal recursive algorithm Cantor third set and achieve limited iterations!
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.
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.
digui_flower
- 一个分形几何中最常用的递归算法所画的鸡冠花，仅几行代码。可以改变中间的宏定义以实现不同的图形，笔者还画出了树。-a fractal geometry of the most commonly used recursive algorithm painting cockscomb, just a few lines of code. The middle can be changed to achieve Acer different definition graphics, the author
fractal_tree
- 1.LS文法生成算法和递归算法编程实现分形树 2.提供界面允许用户输入分形树迭代次数，由程序绘制树形分形体 3.实现可视化
递归的应用：最简单分形图形实现
- 递归的应用：最简单分形图形实现可实现图形的多方位显示-recursive applications : the most simple fractal graphics can be realized to achieve the multidimensional graphics display
RecursiveFractalAnimationtreeimplementation
- 该代码采用递归算法编程实现下列分形树，并且提供界面允许用户输入分形树迭代次数,有程序绘制树形分形体并动画显示分形树生长过程 代码内含文档说明 -Recursive algorithm using the programming code to achieve the following fractal tree, and provides the interface allows the user to enter iteration fractal tree, the procedur
dgfxs
- 递归实现分型树，由一个主干开始生成一棵完整的树-Typing recursion tree, from a trunk to start generating a full tree
DiguiFenxing
- 基于Visual c++ 语言，利用递归分形技术实现图形的绘制。-Visual c++ language based on the use of recursive fractal graphics rendering technology.
Fractal-algorithms-
- 本书从实用的角度出发，论述了分形图形的生成算法与程序设计。主要内容包括分形图的递归算法、文法构图算法、迭代函数系统算法、逃逸时间算法、分形演化算法，以及分形图的放大、分形图的动画、分形图的立体化和利用分形算法实现自然景物的模拟等内容。-From a practical point of view the book, discusses the fractal graphics generation algorithms and programming. The main contents inc
bd
- 创建一个mydll动态链接库，在其中编写一个函数DrawTree()，实现一个递归分形树。-Mydll create a dynamic link library, write a function in which DrawTree (), implement a recursive fractal tree.
snow
- 本程序实现的是koch snow分形，为了雪花显示明显，设置递归次数n=4，运行后会出现一个雪花状的画面。-the koch snow can be developed in this cpp.
Fractal-curve
- 用MATLAB实现几种分形曲线的源程序，里面用了递归，程序绝对可用，可调参数。-MATLAB source program snowflakes curve, use inside the recursion, and procedures can be absolutely, adjustable parameter.