A function of better CAD drawing program, for trade

GEOMETRY is a collection of routines for geometric calculations in 2, 3 and N space. These calculations include angles, areas, containment, distances, intersection, nearest point, and volumes. The objects considered include points, lines, line segments, polygons, planes, polyhedra and vectors.-GEOMETRY is a collection of routines for geometric calculations in 2, 3 and N space. These calculations include angles, areas, containment, distances, intersection, nearest point, and volumes. The objects considered include points, lines, line segments, polygons, planes , polyhedra and vectors.

X.264的core代码 包括，VLC可变长编码，帧间预测，环路滤波等-X.264, including the core code, VLC variable length coding, interframe prediction, loop filtering

C++Builder实现图象的百叶窗效果，原理简单，运行速度快，效果很好。-C Builder Image louver effects and is simple and fast operation and the results very good.

这是一个用VC写的2D Bezier曲线生成演示程序，可以根据鼠标点击实时生成B曲线。-This is a written with VC to generate 2D Bezier curve demo program can be generated in real time in accordance with the click of a mouse B curve.

一篇很不错的在VC6和vc.net中使用加载opencv beta 5的文章，里面含有安装配置并附加打开文件、角点检测、轮廓跟踪等源程序。-a very good and the VC6 vc.net use of beta load OpenCV five articles , it contains configuration and installation of additional open files, corner detection, contour tracking source.

判断点是否属于一个多边形。最基本的功能，但很实用，从中可以学到一些很基本的几何操作，非常适合初学者啊啊啊啊啊。非商业用途，请尊重别人的知识产权。

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

C语言的OPENVG的1.1参考实现，速度慢，可作OPENVG算法实现的参考。-C language reference implementation OPENVG 1.1, slow OPENVG algorithm can be used for reference.

VisualC++数字图像处理配套光盘-VC digital image processing matching CD

图形学中的纹理贴图程序-graphics textures of procedures