本文算法首先对立体图像对中的左图像进行DT网格剖分，把各三角形的顶点作为“特征点”在右图像中寻找它们的匹配点。
The algorithm first describes the left image with DT mesh. As feature points, the vertexes of triangulations are matched in the right image for finding their corresponding points.
给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集(团)具有最大权。
Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices (i. e., a clique) having the largest total weight.
给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集(团)具有最大权。
Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices (i. e., a clique) having the largest total weight.
应用推荐