搜索资源列表
360compkill
- The solution of the Chinese postman problem using matching theory is given. The convex hull of integer solutions is described as a linear programming polyhedron. This polyhedron is used to show that a good algorithm gives an optimum solution. The
tubao
- 凸包算法及实现,供学习和参考使用，-Convex hull algorithm and implementation
convexl
- The convex hull of a set of points is the smallest convex set that contains the points. This paper presents a convex hull algorithm that combines the 2-d Quickhull algorithm with the general dimension.
An-expanding-SOM
- 自组织映射（SOM）已成功处理的欧式旅行的鹅岭推销员问题（TSP）。通过将其邻域保持财产和 凸包属性数值模拟TSP，我们引入了一个新的SOM如神经网络，称为前panding的SOM（ESOM）的。在每一个学习的迭代，ESOM提请接近的兴奋神经元 输入的城市，并在此期间，推压它们向凸包ofcities合作。 ESOM可能收购邻里保护财产和凸包的属性 的TSP，因此它可以产生接近最优的解决方案。从理论上分析了其可行性 和经验。一个的系列ofexperiments进行合成和基准的T
CONVEX-HULL-OF-A-SIMPLE-POLYLINE
- 一种快速计算图形凸包的算法，算法比较简单，实现起来也很容易，有兴趣的可以参阅一下。-A fast algorithm to calculate the graphics convex hull algorithm is relatively simple, and is also very easy to implement, are interested can see what.
Convex-hull
- 根据基于生成凸包的算法，编写一个自动生成凸包的程序- According to the convex hull based algorithm to generate, write a program to automatically generate the convex hull
drilling-vibration-
- 调用matlab程序，利用凸包原理，实现了钻柱振动监测，程序源代码可见，但实测数据保密-Call matlab procedures, the use of convex hull principle, to achieve the drill string vibration monitoring, program source code visible, but the measured data privacy
Convex-hull-algorithm
- 凸包算法。寻找最少的点包围点云，可以用来绘制色空间的色域。-Convex hull algorithm. The least points will be founed surround all the point cloud, which coule be used to draw the color gamut for color space.
Archetype-Hull-Ranking
- 我们设计一个新奇的规则化框架以学习相似性度量用于无约束人脸验证。我们形式化它的目标函数通过融合鲁棒性对于大规模的个人人脸的内部变化和新奇的相似性度量的辨别力。额外，我们的形式是一个凸优化问题，保证了全局最优解的存在。-we migrate such a geometric model to address face recognition and verification together through proposing a unified archetype hull rankin