二

２维空间的delaunay剖分 比较好理解　虽然复杂度大了点　呵呵　-2-dimensional space subdivision delaunay Although better understanding of the complexity of a big point huh

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

利用Solidworks APIVisual Basic 与 开发的自动改变Solidworks当前激活的装配件文档的配置-use Solidworks APIVisual Basic and development of the automatic change So lidworks current activation of the equipment configuration files accessories

本程序实现了一个小小的动画操作，小猫从天而降，对vbGUI操作具有借鉴作用-This program implements a small animated operation kitten from heaven, to have a reference for operation of vbGUI

应用背景如何让CDC上输出的文字、图形具有保持功能，集合类CPtrArray的使用，CPaintDC与CClientDC的区别与应用，OnPaint与OnDraw在CView中的关系及实现内幕，关键技术滚动窗口的实现，坐标空间，映射方式，设备坐标与逻辑坐标的转换。元文件设备描述表的使用，如何利用兼容DC实现图形的保存和再现。。

一个图像分割和边缘提取的程序，是基于matlab的，是我毕业时写的一个程序。-An image segmentation and edge detection procedure is based on the matlab is that when I graduated from a program written in.

BMP文件转换为JPG文件的源代码,调用了jpgdll.dll -BMP file into a JPG file of source code, call the jpgdll.dll

maya5_6XFileExporter

图像角点提取－harris，以及非最大抑制等，并有其他角点检测代码-Image Corner Detection-harris, as well as non-maximal inhibition, and has other corner detection code

Douglas-Poiker抽稀算法（又称道格拉斯车抽稀），用于二维图形节点抽稀.-Douglas-Poiker pumped dilute algorithm (also known as Douglas cars pumping diluted), 2D graphics for pumping dilute nodes.