Based on polygon convex hull method, the chord line is extracted.
采用了基于多边形凸包的方法提取弦线。
This is why the convex hull algorithm front of some preparation work!
这个正是凸包算法前面的一些准备工作！
Constructing convex hull of planar point set is a basic algorithm in computational geometry.
求平面点集的凸包是计算几何的一个基本算法。
The hardness of convex hull is higher than that of pit portion on the sculptured leaf surfaces.
植物非光滑叶表形态中凸包处硬度较凹坑处的硬度大；
Tube caps include convex hull, hats, cone tube diameter changes, flat cover and tightening of design.
管帽包括凸形管帽、锥壳、变径段、平盖及紧缩口的设计。
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
The machine can also make convex hull on paper which is especially suitable for the heavy duty air filter.
此机可根据客户要求还能在纸上打凸包，特别适合生产特种大空滤。
Yes, convex hull is at the kernel of computational geometry and serves as a fundamental geometric structure.
是的，凸包是计算几何的核心问题，也是一种基础性的几何结构。
Convex hull problem is one of the fundamental problems in computational geometry, and is used in many fields.
凸包问题是计算几何的基本问题之一，在许多领域均有应用。
It USES techniques of image skeletonization, convex hull convergence and rectangular frame convergence algorithms.
运用于图像中轴变换、凸包逼近、矩边逼近等算法。
The paper is concerned with two aspects:A necessary and sufficient condition for convex hull of a set in E2 being closed;
本论文以凸体为研究对象，主要涉及两个方面的内容：平面凸集的凸包为闭集的充分必要条件；
The author proposed a new rotating coordinates convex hull algorithm, and using it in assessing roundness to reduce the computation.
提出了一种新的基于坐标旋转的凸包算法，并将其运用在对圆度误差的最小外接圆评定算法中，减小计算量。
Specifically, given a set of points in the plane, please construct the convex hull and output an encoded description of all the extreme points.
具体地，对于平面上的任意一组点，请构造出对应的凸包，并在经过编码转换之后输出所有极点的信息。
The paper presents an efficient approximate algorithm for Convex Hull of very large planar point set. That is Point Set Coordinate Rotation Algorithm(PSCR).
提出了一种计算海量平面点集凸壳的快速近似算法——点集坐标旋转法（PSCR）。
Two kinds of common operation on the set of nodes in a plane are calculating its convex hull and triangulation, and usually the algorithms are studied independently.
平面点集作为一种常见数学模型，其上常做的运算是求其凸包和三角网格。
Its applied algorithms such as skin color segmentation, convex hull computation, fingertip detection and etc have been investigated and the hardware has been designed.
对系统所采用的肤色分割、凸包计算、指尖检测等算法进行研究，并完成硬件设计。
To solve the problems, the minimum internal convex hull algorithm is proposed in this paper. The method holds both low-computational costs and faster calculation speed .
最后，介绍了目前流行的两种投票法，并针对现有投票法的问题和缺点，提出一种最小内凸包的算法。
The second algorithm is that polygonal concave points and newly created concave points are continuously removed, and a vertex sequence of the convex hull is finally obtained.
第二个算法不断删去多边形的凹点及新产生的凹点，最后得到凸壳顶点序列。
The difference function between the ACF and the convex hull is obtained, and then the precession period is estimated by searching for the maximum value of the difference function.
首先求出acf和其凸包的差函数，然后搜索差函数的最大值，从而得到进动周期的估计值。
Numerical experiments show that the improved Convex Hull-based training data selection algorithm reduces the training time, maintains a good generalization ability and has some reference value.
数值实验表明，改进的基于凸壳的训练数据选取算法缩短了训练时间并保持了良好的泛化能力，具有一定的参考价值。
As the disorder progresses, the bottom of the foot can become convex, bulging like the hull of a ship.
由于无序的进展情况，底部的脚可以成为凸，鼓胀如船体的一条船。
As the disorder progresses, the bottom of the foot can become convex, bulging like the hull of a ship.
由于无序的进展情况，底部的脚可以成为凸，鼓胀如船体的一条船。
应用推荐