搜索资源列表
lurchin
- 分形几何图形树型生长的图形很美 国外一家伙写的我还没这本事-fractal geometry graphics tree growth abroad a beautiful guy I did not write this ability
fractalcompress
- 图象处理及分形图象压缩是针对真彩(24位色)BMP图象进行简单处理和能够进行分形图象压缩的程序.分形图象压缩采用了固定分块和四叉树的方法,小波零树编码的方法还有问题. 图象处理部分对图片大小没有要求,分形图象压缩部分对图片大小有要求,大小应是2的次方幂(例如大小应是128*128,256*256,512*512等等),否则在菜单上看到的图象压缩里子菜单是灰的,不起作用. -image processing and fractal image compression is against
fi_treegen10
- vc++ opengl实践分形树 可更改许多的条件 使树木发生变化-vc opengl practice fractal tree to alter the conditions in which many of the trees change
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
fractaltree
- 分形树。java写的分形树，可以调整参数，分形几何很好玩。-fractal tree. Java was the fractal tree, parameters can be adjusted, fractal geometry is a lot of fun.
huishufenxing
- 桧树分形小枝:win32+GDI+分形算法；经典课程例子的vc++实例-cypress trees Fractal branchlets : win32 GDI fractal algorithm; Classic examples of courses example vc
BinarySortTree
- 经典数据结构例子: 二叉排序树的应用-- 排序与检索.-classic example of data structure : binary sort of tree -- Sorting and Searching.
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
IFS
- 这里面包含了几个常用的IFS的分形图的绘制方法如枫叶，分形树等。-There are a few commonly used fractal IFS mapping methods such as Maple, fractal trees.
tree
- 分形树算法，简单，适合初学者学习，用c++实现-Fractal tree algorithm, a simple, suitable for beginners to learn, use c++ implementation
2_16
- 递归分形树的形成，利用递归算法生成分叉树，将这个生成元在每一个层次上不断重画-Recursive fractal tree formation, the use of recursive algorithm to generate bifurcation tree, will the generator on at every level constantly re-draw
GenFraTree
- 包含二维分形树实现算法的一个程序，希望对毕业设计做这个方向研究的同学有所帮助-Contains two-dimensional fractal tree algorithm of a program, would like to do graduate design studies in this direction will help students
8
- 生成规则：以如图8-27n＝2所示二叉树为基础，以每个分支为主树干，按照比例递归出另一个二叉树，如图8-27n＝3所示。依此类推，便形成了疏密有致的分形树，称为Caley树-Generated rules: in Figure 8-27n = 2 as shown is based on binary tree to each branch of the main trunk, in accordance with the proportion of another recursive bina
Fractal
- 图形学中的基于L文法的分形树及M集的绘制实现-Fratual tree and M
dgfxs
- 递归实现分型树，由一个主干开始生成一棵完整的树-Typing recursion tree, from a trunk to start generating a full tree
L-System[1].F_tree
- L系统分形树的实现，使用VC++和OpenGL实现的-L system, the realization of the fractal tree, using VC++ and OpenGL implementation
dyqfenxing
- 关于分形压缩的资料。采用的算法是四叉树，很好。有编程基础的能看懂。-Fractal compression on the data. Algorithm is used in four-tree, very good. A programming foundation can read.
tree1
- 1 分形树的递归生成,相对来说比较简单，可以扩展-A fractal tree of recursive, is relatively simple, can be extended
2-3Tree
- 利用C++实现2-3树，课程作业，仅供参考(Implementation of the 2-3 tree)
IFS-分形树
- 代码是用Java实现的基于迭代函数系统（IFS）算法的分形树图像。