Location:
Search - sanjiaopoufen
Search list
Description: 这个程序是用C++来实现的最优三角剖分问题。用的是动态规划算法来实现的。-This procedure is used to achieve the C optimal triangulation problem. Using a dynamic programming algorithm to achieve.
Platform: |
Size: 10136 |
Author: 郑淑美 |
Hits:
Description:
Platform: |
Size: 592896 |
Author: 郑淑美 |
Hits:
Description: 实现凸多边形的三角剖分，c++源代码，拷到编译器下即可调试运行，没错误，不想下的很多程序代码调试有错误。-Achieve convex polygon triangulation, c++ source code, copying it to debug the compiler can be run under, no errors, do not want to debug code under a lot of mistakes.
Platform: |
Size: 1024 |
Author: phoenix |
Hits:
Description: 在VS2008和opencv下，对2D/3D点(云)数据实现三角剖分，运算速度快，实时性好，计算精度高，并对三角剖分进行了优化，可以处理复杂点集的三角剖分，可以用于人脸识别的工作-In the VS2008 and opencv, the pairs of 2D/3D points (cloud) data to achieve triangulation, calculation speed, real-time performance is good, high precision, and triangulation is optimized to handle complex point set triangulation can be used in the work of face recognition
Platform: |
Size: 146432 |
Author: 三角剖分VC++ |
Hits: