查询词典 absolutely convex hull

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类。

The convex deadrise adds curvature and form to the hull bottom and the wide beam which carries aft increases lifting motion in a seaway.

凸deadrise增加曲率和形式向船体底部和宽束载尾部增加了起重机械的议案，在海运。

Rubberand drum at maximum force at A point of RADIUS R1 and minimum mechanical Department b. RADIUS R2 is different, rubber roller compression over C forms the convex hull, the radius of the highlast C is R3, point b is the radius of the lining of the RADIUS rubberand drum after three RADIUS R1 with the size of the change of Center distance drum to determine the ideal pressure: 0.5mm by Feller gauge or flattening of galvanized wire to precise tuning of two drums of hobber pillow gap, so that it is up to the required data.

橡皮滚筒在最大受力处A不面的半径R1和最小受力处B不面的半径R2是差别的，橡皮滚筒受不抬后转动在C处变成凹包，凹包最矮不面C的半径是R3，B不面的半径是包衬后的橡皮滚筒半径不一个半径的巨细的R1 用保留滚筒洋心距来猜测抱负不张力：用塞尺或0.5mm的铅丝不抬扁来大略不天调动二滚筒的滚枕间隙，使之符分规矩的数据。

Figure 2 printing plate gaskets is higher than the 0.2 ~ 0.3mm hobber pillow, blanket below the occipital hobber 0.05mm, a2, B2 Department produces a smaller convex hull, of course, less friction and sliding, wear plates, no szlama and "" taping, fault-printing plates and high, less hierarchical dot gain, clearly, the life expectancy of the machine, the electrical power consumed less.

图2印版的衬垫矮于滚枕0.2～0.3mm，橡皮布矮于滚枕0.05mm，在A2、B2处爆发的凹包较小，当然摩擦和滑动也多，印版磨损较多，无不推不净和"杠子"障碍爆发，印版的耐印率矮、网不面放大多，条理纯楚，机械的寿命放大，电机耗电也多。

The paper presents an efficient approximate algorithm for Convex Hull of very large planar point set.

提出了一种计算海量平面点集凸壳的快速近似算法——点集坐标旋转法。

Comparison of much experiment data shows that the algorithm is very efficient for calculating convex hull of planar massive scattered point set, and for the point set of 107 level, its execution time on a 2.00 GHz personal computer is only three to four seconds.

通过大量实验数据对比说明，算法对求平面海量散乱点集的凸壳非常有效，点集为107数量级的执行时间在主频为2.00 GHz计算机上仅为

A better plane is the so-called maximum area plane, i.e. the plane on which the convex hull of the projection forms a maximum area.

一种更好的曲面被称为最大面积曲面，就是曲面所在的投影凸起外壳构成最大面积。

Then, the notion of ordered target triangle was defined. It quickly found ordered target triangles and generated the non-ray Voronoi diagram. Considering the characteristics of convex hull, a ray Voronoi diagram was generated by three infinite points.

然后又定义了有序目标三角形的概念，该算法能迅速查找点的有序目标三角形，生成无射线的Voronoi图；考虑凸壳上点的特性，借助三个无穷点生成带射线的Voronoi图。

The shaping method of noncircular part and the tool holder's radial motion characters in noncircular turning process are discussed in detail in the thesis.

论文详细研究了非圆零件的成型方法和加工过程中刀架的径向运动规律。

I have not really liked him,I do not like his this kind of disposition.

我没有真的喜欢他，我不喜欢他的这种性格。