查询词典 hull

The popular minimum convex hull algorithm is not fit for processing mass data due to its big time complexity.

当前流行的最小凸包算法的时间复杂度相对较大，不适宜处理海量数据。

The convex hull of SBGB and subdivision algorithms are also discussed.

此外，还讨论了SBGB曲线的包络及细分算法。

Being a basic structure of computational geometry, convex hull is important to data analysis of GIS.

摘 要：(浅谈平面海量散乱点集凸壳算法)凸壳作为计算几何的一种基本的结构，对GIS的数据分析有着重要作用。

If a segment have at least on point on its left then we eliminate in from the convex hull segments.

如果一个领域有至少点在其左侧，我们消除了凸包段英寸

Achieve a two-dimensional point set of convex hull algorithm, which uses quick sort.

实现了一个2维点集的凸包算法，其中用到快速排序。

The Convex Hull of a given points P in the plane is the unique convex polygon whose vertices are points from P and contains all points of P.

在给定的点在平面P凸包是独特的凸多边形的顶点从P点，并包含换句话说P的所有点的集合P点是最小凸集凸壳含有体育

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.

第二个算法不断删去多边形的凹点及新产生的凹点，最后得到凸壳顶点序列。

Collision detection of high density point set based on convex hull.

基于凸壳的高密度点集物碰撞检测算法。

It rotates the point set and calculates the extremum of X coordinate, and finally gets the Convex Hull of the point set.

它充分利用了成熟的数据库技术，能够在比较短的时间内计算出海量平面点集的近似凸壳。

Based on quickqull algorithm,an improved algorithm to determine the convex hull of 2-D point set was proposed in this paper.

凸包问题是计算几何的基本问题，分为平面点集凸包和多边形凸包2类。

In the negative and interrogative forms, of course, this is identical to the non-emphatic forms.

。但是，在否定句或疑问句里，这种带有"do"的方法表达的效果却没有什么强调的意思。

Go down on one's knees;kneel down

屈膝跪下。。。下跪祈祷