检测对象，使一方

开发了一套具有cad软件的一些功能，方便大家画图-developed a cad software with the functionality to facilitate drawing

rpg game

基于vtk的三维重构与裁切: 1.16位非压缩位图的读取与设置. 2.图像数据载入映射器 3.裁切平面的设置 4.边界的设置与显示 5.三维重构 注:需安装vtk4.0以上版本-It s about 3D reconstruct and clip based on VTK including reading and configration of 16 bits non_contracted bitmaps,the mapper for image data loading, configration of plane for clip,configration and display of borders and 3D reconstruct.(PS:VTK 4.0 or above version is needed)

这是用VC6.0编写的绘制三次Bezier曲线的程序，使用MFC框架文档视图结构。程序除实现三次Bezier曲线的绘制，还实现了点，直线，圆的绘制，可做为学习计算机图形算法的参考。与其它Bezier曲线绘制程序的不同是，本程序实现了Bezier曲线上型值点的计算显示。程序中编写了Bezier曲线类来完成Bezier曲线的绘制，并能对绘制的曲线数据进行保存与打开。对学习文件操作也有一定帮助。这是我第一次上传源码，有什么不妥之处还请管理员指点。谢谢！-VC6.0 prepared by the cubic Bezier curve drawing procedures, use MFC framework document View structure. In addition to procedures to achieve cubic Bezier curve drawing, but also realized the point, line, round mapping, can be used as learning computer graphics algorithm reference. And other Bezier curves of different procedures, The program of Bezier curve-point value calculations show. Procedures prepared Bezier curves like to complete the Bezier curve drawing, and is able to draw the curve data preservation and open. Operation right to study the documents will also help. This is the first time I uploaded the source code, what is wrong with this manager also requested guidance. Thank you!

图形学中实用的Port技术源代码。-Graphics Port technology practical source code.

实现一个opengl程序，要求画一个茶壶，放置在位置（100，50，200）处，对其设置一个合适的透视三维观察空间，并设置一个裁减面裁去其一部分。 -To achieve a opengl procedure that requires painting a teapot, placed in the position (100,50,200), Office set up a proper perspective of its three-dimensional observation space, and set a cut to his face as part of the Conference.

070325 全部程序（多项式拟合标定、多种滤波方式）工件测量输出实际mm尺寸-070325 All procedures (polynomial fitting calibration, multi-filter approach) mm workpiece measuring the actual output size

Polygon clipping is one of those humble tasks computers do all the time. It s a basic operation in creating graphic output of all kinds. There are several well-known polygon clipping algorithms, each having its strengths and weaknesses. The oldest one (from 1974) is called the Sutherland-Hodgman algorithm. In its basic form, it is relatively simple. It is also very efficient in two important cases, one being when the polygon is completely inside the boundaries, and the other when it s completely outside.

可以实现的热区,好玩-heat can be achieved, fun

对初学者非常有用,学习vega的经典的100个有用的程序-very useful for beginners to learn the classic Bond 100 useful procedure