Teechart

说明：  MFC坐标系的绘制，动态显示曲线，感兴趣的可以参考下~~(MFC frame rendering, dynamic display curves of interest can refer to the following ~ ~)

关于固高运动控制卡T曲线运动模式程序的例子(About Googol motion control card T curves sport program)

画画的,一个简简单单的画画的小型的C++编的软件(Paint of, a Chien is simple painting of list of small scaled C++weave of software)

绘图板软件，实现了文件打开，矢量保存，各种线和图形的绘画，颜色的更换。(it is a paint pad,you can use it to change your color,your paint,and can save yours.)

MFC下实现DDA算法、一般直线的Bresenham算法、Bresenham画圆算法 、中点圆整数优化(MFC DDA Bresenham )

很好的齿轮cad参数化设计程序，能够进行直齿轮和斜齿轮的参数化设计和cad绘图输出(Cad good gear parametric design process, can spur gear and helical gear parametric design and cad graphics output)

自由曲线图表、柱状图、饼图的实现与转换，基于一套简单的图形类库（源代码在内）。(free curve charts, column, pie and the realization of conversion, based on a simple set of graphics libraries (including source code).)

画曲线图的c++例子，使用定时器去随机数的方式画图。(Draw the curve c example, use the timer to go the way of the random number drawing.)

等值线函数.// As this code is ported from FORTRAN-77, please be very careful of the // various indices like ilb,iub,jlb and jub, remeber that C/C++ indices // starts from zero (0)(contour function.// As this code is ported from FORTRAN-77, please be very careful of the// various indices like ilb, iub, and* address, remember that the C/C indices// starts from zero (0))

说明：  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)