矢量图绘制源码。看了这个程序，小的矢量图形的绘制就不难掌握了。

This colour picker allows you to easily choose a colour either using RGB or HSV, it includes an alpha slider (that can be disabled or hidden, if needed), and it displays the colour value in hexadecimal. The code is fully written using Windows API, without MFC.

得到位图或位图文件的宽和高 -Getting the width and height of image or image file

读取两个txt文件中的坐标来判断两个多边型是否匹配，结果在一个对话框中显示-read two documents to determine the coordinates of type 2 multilateral whether matching results in a dialog box shows

超简单的皮肤例子,不知道是皮肤被人搞得很复杂,还是被我搞得很简单,为了方便操作,我在里面使用了DC类来操作,如果不喜欢完全可以只用bilbit来做-Super-simple skin example, do not know the skin was Gaode very complicated, or was I inspired is very simple, in order to facilitate the operation, I used the DC inside the class to operate, if you do not like to do can only bilbit

该程序简单的利用数码管的位图来显示系统时间，而且该程序界面采用无窗口设计,浮动与桌面之上。而且其还采用了托盘控制方式。-the simple procedures governing the use of digital bitmaps to display system, but the program interface by using window design, floating above the desktop. It has also adopted its pallet control mode.

对VC的传统控件进行了一些简单的改写做成象开关那种的样式-VC traditional control of some simple as switching rewrite caused the kind of style

用GDI+转换图形格式，需要下载相应的GDI+库等，建议将VC SDK升级到最新 升级地址： http://www.microsoft.com/msdownload/platformsdk/sdkupdate/ -graphics interchange format using GDIplus ,which need to download relevent GDI+ LIB.So advice you upgrading your VC SDK to the newest upgrade net.

图象VC编程的基本源码,有图象的读取,存储,和编写处理的源码,可在处理涵数中修改以得到所需的图象.-image of the VC basic source code, the images are read, storage, handling and preparation of the source code, in which culvert several changes to get the image.

图象处理源代码，介绍了利用迭代法对BMP图像进行二值化的方法-image processing source code, introduced to the use of iterative method of BMP images value of the two methods

Hough变换用来在图象中查找直线。它的原理是：假设有一条与原点距离为s，方向角为θ的一条直线，直线上的每一点都满足方程 s=x*Cosθ+y*Sinθ，利用这个事实，我们可以找出某条直线来。这段程序，用来找出图象中最长的直线。-Hough Transformation is used for searching lines in an image . Here is the principle: Assume there is a line whoes direction is "sita" , and the distance from the origin to this line is s. So each point in this line satisfies the equation : s=x*Cos(sita)+ y*Sin(sita) . We can find out the lines based on this fact. And this programme is to find out the longest line in the image.