资源列表
GraphicWork
- 图形学作业，比较全面，虽然花的时间不多，但是整体感觉还不错吧-graphics operations, a more comprehensive, though not much of the time spent, but also the overall feeling good! !
CBImage
- 图象处理，可以处理图象的各种操作，比如边界寻找，填充。-image processing, image processing can be of various operations, such as borders in search of filling. And so on and so on and so on.
图形学实验
- 一个低分辨率的图形包,做的比较差,但是通过这个图形包可以了解到图形是如何生成的.-a low-resolution graphics package, so the relatively poor, but through this graphics package could see how graphics are generated.
20051216165434883
- 这是一个用vc编写的简单的图形查看器程序，它可以用来实现图形查看的功能，好用哦-vc
ImageFFT2
- VC编写的高效的图象2D快速傅立叶正变换程序,编译通过.适合256色bmp图象变换.效果和matlab的fft2()没法比,但是程序值得借鉴.适合图象处理初学者,有助于理解傅立叶变换在图象处理中的重要作用.-VC efficient preparation of the image is 2D fast Fourier transform procedures compile. Bmp for 256-color image transformation. Results and Matlab
Bresenham高效画线算法
- 画线的算法不少，但要作到高速、简单并不容易。斜率相乘法是最简单的方法之一，但计算每个点均要花费不少时间用于乘、除法运算；下面介绍的是Bresenham s高效画线算法，对每个点的坐标计算只要加、减法就能完成。-line drawing algorithm, but a lot to be done fast, simple is not easy. The slope is the most simple multiplication is one of the ways, but each p
MFC实现多边形画图填充
- MFC实现多边形画图和填充,对学习图形学有一定的好处哟!-MFC polygon drawing and filling, to learn graphics have certain advantages yo!
二维图形游戏编程实例
- 二维图形游戏编程的几个很好的实例，如BMP图形创建、碰撞反弹、色彩混合等演示、动画。-2D game programming in several good examples, such as the creation of BMP graphics, collision rebound, such as color mixing demonstration of animation.
Quxians1
- b样条曲线绘制。很小的文件，功能相对来说比较简单。-b-spline curve drawing. Small paper, function is relatively simple.
detectpic
- 用c语言实现的用差影法检测图像，用模板匹配图象-with the language used poor video image detection with template matching image
图形实验
- 用delphi开发的图形学边界点和内点的区域种子填充算法和扫描线种子填充算法-with graphics developed by the border point and the point within the regional seed filling algorithm and scanning lines of seed filling algorithm
huffman_f
- huffman_f 在huffman_e的基础上，将排序改为利用堆排序原理选择最小的两个权值。也即，将所有元素的权值组织成堆后，每次堆内的根结点就是最小值了。每取出一个根结点后，就把堆尾元素调到根结点重建堆。取出两个最小值合并成一个子树后，再把子树作为叶子结点放到堆中，并让其上升到合适的位置，保持堆性质不变。因为每次不必完成整个排序过程，而只是组织成堆，因此，这种方法要比使用快速排序更快。上述算法参考了mg-1.2.1中Huffman编码的实现，见http://www.cs.mu.oz.au/m