Bresenhamline

手动绘制点，自动生成样条曲线，可以拖动修改点来修改样条曲线(Manually plotting points, automatically generated spline curves, you can drag the modified point to modify the spline)

小型画图板，实现了简单画图板的一些个别简单的功能。(simple draw)

改进的Bresenham算法，用visual c++ 实现(Improved Bresenham algorithm, using visual c++ achieve)

这个程序是用Breseham画法在visual c++平台下画直线和圆。可以对图像进行刷新，画多条直线，多个圆(This procedure is used Breseham paint in visual c++ platform for the next drawing a straight line and circle. Can refresh the image, painted more than a straight line, a number of round)

关于三轴雕刻机用C语言实现，此为C方式下实现绘画CAD图。(About three-axis engraving machine with C language, this is C mode drawing CAD drawings.)

利用逐点法绘制出图形，图形的绘制其实都是由折线组成的，只是每条折线的误差太小了，肉眼根本分辨不出来(use of the point-by-point drawing graphics, the graphics are actually drawn from the composition of the dogleg, only broken each of error is too small, the human eye can not be seen)

对图片进行网格划分，以及绘图获得区域，最终获得灰度矩阵(Mesh the image, and draw the region to obtain the gray scale matrix)

用于酶标仪控制，具备波长设定、标准曲线拟合，结果打印。(For the microplate reader control, with the wavelength set, standard curve fitting, the results of printing.)

for PSCAD softwear it can be very easy and coming soon challenger in this soft

说明：  1． 做一个集成的图形界面的程序，可调用每一次作业子程序。 2． 调用画点的函数，用DDA、中点算法画直线和中点算法及正负法画圆和抛物线。 3． 交互式的二维直线求交：如果存在交点，用实心圆显示交点，并用文字显示其坐标。 4． 用动画实现二维图形变换的各种算法，实现对指定形体的平移、旋转和缩放。（包括自行车行走和绕固定点旋转的自旋转物体动画。） 5． 线段裁剪和多边形裁剪算法的动画演示实现。（两种线段裁剪算法和H-S多边形逐边裁剪算法）多边形裁剪算法的动画演示要求先画出一个封闭的多边形，再画矩形的裁剪窗口，然后选择裁剪按钮（或命令），按下“上边裁剪”按钮（或执行“上边裁剪”命令），多边形相对裁剪窗口的上边进行裁剪，显示上边裁剪后的多边形，依此进行其它各边裁剪。 6． 两种扫描多边形扫描转换算法实现（扫描线算法为必做，基于求余运算的边缘填充和边标志算法任选一种）； 7． 4连通区域的递归种子填充算法，和扫描线种子填充算法，要求种子点(x,y)可交互输入）。 8． 简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。 9． 交互式Bezier曲线的输入绘制程序实现 (1. So an integrated graphical interface procedures, which call for each operation subroutine. 2. Calling the painting point function, with DDA, the midpoint algorithm painting line and the midpoint algorithm and France Circle and the positive and negative parabola. 3. Interactive 2D linear intersection : If there intersection with a solid circle indicates Nodal and writing to demonstrate its coordinates. 4. Using 2D animation graphics transform algorithms to achieve the specified physical translation, rotation and scaling. (Including walking and cycling around the fixed point of rotating objects from the rotating animation.) 5. Line cutting and polygon clipping algorithm to achieve the animation demo. (Two segments cutting algorithm and H-S-by-side polygon clipping algorithm) polygon clipp)