查询词典 absolutely convex hull

The research development of ultimate strength of hull structure is summarized and the calculation method of ultimate strength of stiffened plate,hull plated grillage and hull girder is analyzed as well as the trial research on ultimate strength of hull structure .

综述了船体结构极限强度的研究现状，分析了加筋板、船体板架和船体梁极限强度的计算方法以及船体结构极限强度的试验研究。

The hull (4) has an abruptly down-swept trailing edge portion (18) which, in the preferred embodiment, is in the form of a flap extending across the full width of the transom of the hull and which projects beyond the level of an upswept portion of the underside (14) of the hull by only a small fraction of the length of the hull.

该船体(4)具有一个突然下掠的后缘部分(18)，在优选实施例中，该后缘部分呈横过船体尾板全宽延伸的折翼的形式，并且该后缘部分超过船体下侧面(14)的上掠部分的水平只伸出一个船体长度的一个小部分。

By using the Graham scanning for the convex hull extraction and fitting these convex hull points with the conics,roots of the conics are regarded as points we need.

采用格雷厄姆扫描法对包络进行凸壳提取，并用二次曲线拟合凸壳点，计算出拟和曲线的根。

Based on the analysis of traditional convex hull algorithm, a new convex hull algorithm is presented, i.e. pyramid algorithm.

在分析传统的凸壳算法的基础上，提出新的凸壳算法，即金字塔算法。

To compute the convex hull of a planar point set, first to find the extreme points of the planar point set and get the sub collections of points candidate for vertices of the convex hull between them.

新算法达到目前平面点集凸包问题的渐进最好算法的时间复杂度O，其中，n为平面点集的点数，h为平面点集凸包的顶点数。

Triangulation of a set of scattered points on a plane is obtained by a novel algorithm, which generates the convex hull of it in the process of triangulation according to the property that the boundary of triangulation meshes coincides with the convex hull of the set of points.

对于给定平面散乱点集的三角剖分，根据平面三角剖分网格外边界与点集凸包重合的性质，实现了点集凸包和三角网格的综合生成。

The algorithm makes the discrete points sort in scan manner, and secondly it constructs convex hull and triangulates the sorted points by the optimal convex hull technology which is proved by the author, and optimizes triangles utilizing topological structures of directed edges.

该算法对离散点进行扫描线方式排序，利用最优凸壳技术进行凸壳的生成和三角网联结，最后利用有向边的拓扑结构进行三角网优化。

Suppose that f is a real-valued ω〓-lower semicontinuous function defined on a ω〓closed bounded subset A〓 of the dual E〓 of a locally convex space E, which is bounded below on A〓, and suppose every ω〓 closed convex subset of C〓≡ω〓-clcoA〓 is the ω〓closed convex hull of its w〓-β-exposed points.

假设X是一个局部凸空间，X〓是其对偶。A〓是X〓上的ω〓有界闭子集，f是A〓上的ω〓-下半连续实值函数且在A〓上下有界。

An improved algorithm of two dimensional convex hull based on included angle is proposed, and all the convex points are achieved through the maximal included angle by the increasing counter-clockwise direction. When more than one point satisfies the maximal included angle, the most distant point to the previous point is regarded as the next convex point.

提出了基于夹角的平面点集凸包改进算法，以最大夹角，按顺时针的方向可得到所有的凸点，当满足最大夹角的点不唯一时，以离当前凸点最远的点为凸点。

Cross section is a set of polygons and for this reason some relative algorithms for polygon are studied firstly. New algorithms for orientation and inclusion test for simple polygon are proposed. And Ghosh's convex hull algorithms for simple polygon and convex polygons, Subramanian's triangulation algorithm for arbitrary planar domain and O'Rourke's intersection algorithm for convex polygons are modified to make them more robust.

断层轮廓为简单多边形，首先对多边形的一些相关算法进行了研究，提出了一种判断简单多边形方向及点在多边形内外的新方法，改进了Subramanian的平面多连通域的三角划分方法、Ghosh的多边形的凸包及多个多边形的凸包算法和O'Rourke的凸多边形的求交算法。

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.

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