基于光线投射变换的三维模型特征提取,以三维模型的重心为球心的最小包围球剖分成一系列同心球壳，落入每个球壳的射线与模型表面的交点定义一个球坐标方程。一般地，对于每...

开发玻璃条纹采集系统中，需要将4个图片合并成一个图片，图片格式bmp。-development of glass block acquisition system, and the need to four photographs combined into one picture, pictures bmp format.

功能:画平面人工挖孔灌注桩.用于结构专业绘制基础详图.-Features: Flat painting hand-dug pile. The basis for the structure of professional mapping details.

该代码可以拾取屏幕颜色，显示rgb分量！-The code can pick up color screen, showing rgb weight!

可以实现线段的裁减 ，对初学者有所帮助-segment can be achieved reductions to help beginners

应用背景这是我自己研究出的“闪电”，代码已经整理好，只需条用并传参即可使用。可用于动画特效，游戏制作上关键技术计算随机的“拐点”，产生形状不同的闪电。

Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the

关与图像处理的一些小程序，对于入门的人很有帮助，大侠就不用看了-Guan and image processing a number of small procedures, for the entry of people very helpful, heroes do not need to read

Graphics_Pipeline_Performance

交互界面的填充程序-interface filling procedures

这是网上搜集并经过我修改之后，去掉了许多bug之后的版本，可控制播放速度，长度以及大小