您要查找的是不是：
- ConvexHullAccumulator Creates convex hulls for groups of features. 生成分组要素的外接凸多边形。
- Privacy-preserving protocol for finding the convex hulls is a special case of secure multi-party computation problem. 保护私有信息的凸包求解问题是一个特殊的安全多方计算问题。
- The convex hulls were extracted from the feature points of the reference and test images, and then the affine invariants were calculated. 该方法利用从参考图和测试图中得到的特征点提取其凸壳，并计算凸壳的仿射不变特征向量。
- ConvexHullReplacer Replaces the geometry of the feature with a polygon representing its convex hull. 将图形改为其外接凸多边形。
- Hardness of convex hull is bigger than that of pit portion on sculptured plant surfaces. 植物非光滑叶表形态中凸包处硬度较凹坑处的硬度大；
- An easy approach is to create a convex hull around an object's location at two different times. 一条简单的途径就是在不同的时间在一个物体的地点附近创造凸壳。
- An improved image recognition and registration algorithm based on convex hull and affine invariant was presented. 摘要提出了一种新的基于凸壳和仿射不变量的图像识别和配准的方法。
- According to some relative definations, this paper proposed a triangulation of convex hull based on a monotonic chain. 在分析应用相关定义的基础上,该文提出了一种基于单调链法的凸壳三角剖分方法。
- The illustration also shows the spline's convex hull, which is a polygon formed by connecting the four points with straight lines. 该插图还显示样条的凸包,凸包是通过将这四个点用直线相连而形成的多边形。
- Convex hull problem is one of the fundamental problems in computer graphics,image processing,CAD/ CAM and pattern recognition. 确定平面点集的凸壳问题在计算机图形学、图像处理、CAD/CAM、模式识别等众多领域中有广泛的应用。
- Abstract An improved image recognition and registration algorithm based on convex hull and affine invariant was presented. 摘要提出了一种新的基于凸壳和仿射不变量的图像识别和配准的方法。
- Secondly，the suitable parameter is selected to extract the super ball’s lamella which is used to construct the convex hull. 其次，选取合适的参数，提取单位超球体的外壳，用外壳中的点构造其凸包。
- We propose to analyze the spacial conformation of particles by integrating the concepts of the convex hull, hypergraph and depth. 摘要本文的主要目的是把空间多面体、超图与深度这三个概念综合起来，作为描述与分析空间质点系形态的基本工具。
- Finally,the learnability of a concept class C with respect to the probability measures P and its convex hull C(P) is discussed and a mistake of [1] is corrected. 最后讨论了概念族C关于概率族P及其凸包C(P)的可学习性，并纠正了文[1]的一点错误。
- The NEM interpolant is strictly linear between adjacent nodes on the boundary of the convex hull, which facilitates imposition of essential boundary conditions. 根据基本边界条件，自然邻接插值在凸体边界相邻节点之间是严格线性的，于是可以用自然单元法来模拟非凸体表面裂纹。
- There are many existing algorithms to determine the convex hull of a finite planar set,but some of them are very complicated and some are very difficult to be implemented and coded. 现有多种求平面上点集凸壳的方法,但这些方法要么算法非常复杂,要么编码及实现非常困难。
- An Improved Real Time Algorithm of Convex Hull 一种改进的实时凸壳算法
- Algorithm on the Convex Hull of A Simple Polygon 简单多边形凸包的算法
- nearest neighbor convex hull ( NNCH ) classifier 最近邻凸包分类
- nearest neighbor convex hull(NNCH) classification 最近邻凸包分类
