资源列表
BinarySortTree
- 经典数据结构例子: 二叉排序树的应用-- 排序与检索.-classic example of data structure : binary sort of tree -- Sorting and Searching.
fractallandscope_triangles
- 程序可以在matlab环境下，用三角形面元绘制三维立体分形图-procedures in Matlab environment, with triangular surface rendering 3D fractal images
fracoding
- 分形图像编码,基于分形维数对图像进行块分割,提出了一种混合编码方法,引入不变矩限制匹配块的搜索范围.-fractal image coding, based on the fractal dimension of the image segmentation block, a mixed-encoding method, the introduction of the same restrictions Moment matching piece of the scope of the sear
Bezier_3_ins
- Bezier曲线的一般C代码算法,在VC环境下运行的.-the general Bezier curve C code algorithm, the VC environment operates.
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!