搜索资源列表
逐点递归填充算法
- 用OPENGL实现的,可以用来实现定点的绘制．用ＶＣ环境加上ＯＰＥＮＧＬ实现．非常方便实现逐点递归填充算法.-use OpenGL, which can be used for fixed point mapping. VC environment with OpenGL. Very convenient achieve filled bit recursive algorithm.
snowflake
- 关键字: KOCH, 分形, 雪花,递归,MFC,snowflake 这是我MFC下写的一个小程序, 实现分形递归雪花算法. 希望更多的人与我交流, QQ:270596846 E_MAIL:chmuggmwtg@163.com -keyword : KOCH, fractal, snowflakes, recursive, MFC, Snowflake This is my MFC write a small program achieving Fractal snowflakes
PolyCompress
- Douglas－Peucker算法的递归实现，java版-Douglas-Peucker Compresing recursive algorithm to achieve, java version
tx10017
- 三角形逼近球体演示 原理：先用正三角形逼近绘出20面体，然后递归分割，把每个面分割为4个三角形(递归次数可定),此以来逼近球体。-spherical approximation triangle demonstration tenets : first approximation using regular triangle charted 20 Verses, and then recursive segmentation, each side of the divided four t
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
CurvePainter
- n次贝塞尔曲线及三次b样条曲线的绘制，使用自己编写的curve类，实现曲线上点坐标的计算与绘制，曲线点坐标的计算使用递归算法。点击左键设定控制点，之后点击右件绘制曲线。-n Bessel curve and three b-spline curve mapping, prepared to use their own type of curve, curve coordinates of the point on the calculation and drawing, curve coordi
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
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;
erchashu3
- 二叉树的便先中后三中递归和非递归方式的实现-binary tree after they were first three recursive and non - recursive approach to achieve
Subd
- 用递归算法实现的球体的程序，我曲面建模的作业！希望对大家能有帮助-using recursive algorithm of the ball, and I surface modeling operations! We can hope for help
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!
RXYC.tar
- image segmentation using recursive XY cut algorithm
Recursive-forgetting
- 本代码是关于用递推遗忘因子法辨识系统的参数。-The code is on the recursive forgetting factor method with the parameter identification system.
recursive-mean-separate-HE
- recursive mean-separate HE
pixel-recursive-super-resolution-master
- 谷歌Pixel Recursive Super Resolution的代码(TensorFlow implementation of Pixel Recursive Super Resolution.)