This blade has a gentle, sloping convex curve to the point versus the concave curve of the clip blade.
相对于回形刀刃的凹曲线而言，这种刀刃具有一条延伸到刀尖的、温和的凸斜率曲线。
The special meshing of convex and concave teeth profile makes the relative radius of curvature of the contacting point longer.
独特的凸凹啮合齿廓，使两齿轮在接触点处的综合曲率半径较大。
In 1985, prove Theorem 1.1 from the point of Brown Motion. This paper USES the method of establishing the convex envelope, giving a proof in Partial Differential Equation.
在1985年从布朗运动的角度证明了定理1.1，本文利用构造凸包络的方法，给出了该定理偏微分上的证明。
The parallel light rays of the prnicipal axis that approach a convex lens can converge to the focal point.
只有在近轴光线条件下，平行光通过凸透镜才可近似聚焦于一点。
The direction of search starting from an extreme point is a convex combination of all descent directions along the edges at the point.
从极点出发的搜索方向是该点处所有下降棱方向的一种凸组合。
An improved algorithm is proposed based on the polygon convex decomposition algorithm based on point visibility.
在参考基于顶点可见性的凹多边形凸分解算法的基础上，提出了改进的方法。
A collectively fixed point theorem for a family of set-valued mappings defined on a product space of locally generalized convex uniform Spaces is first proved.
对一族定义在局部广义凸一致空间的乘积空间上的集值映射，给出了一个集族不动点定理。
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）。
The border panoramas are created by constraining viewpoint motion to arbitrary convex region of a plane, and sampling cylindrical panoramas at border of the region point by point.
边界全景图通过限定视点在平面上任意的凸区域内运动，并且在区域的边界上逐点采样柱面全景图而构成。
It is shown that a point and a (compact) convex set are separated in this paper, and two compact convex sets are separated by a point of the original space in normed dual space.
给出了赋范共轭空间的点与(紧)凸集、紧凸集之间被原空间中的点分隔的定理。
A convex lens causes rays to converge on a single point, the focal point.
会聚透镜使光线会聚于一点，即焦点。
In this paper, a bundle method for the minimization of the convex nonsmooth function in point by point maximum is suggested.
研究了用束方法求解非光滑逐点最大凸函数的极小化问题。
In this paper we present a convex structure for 2-metric Spaces, and from this we get a fixed point theorem for a kind of nonexpansive mappings.
本文对于2 -距离空间引入了凸结构的概念，并由此得到一类非扩张映象的不动点存在定理。
A clustering successive projection onto convex sets algorithm is presented for fast point matching.
为降低特征点配准的计算量，提出了一种聚类凸集投影算法。
The specially designed convex drain plate prevents accumulation of condensate at the compressed air re-entry point into the bell reducer.
特别设计的凸排水板在防止累积的冷凝压缩空气鉆点成铃的最佳方法。
Two kinds of convex lens which make parallel light rays converge to the focal point are given.
本文给出两种能使平行光严格聚焦于一点的凸透镜。
FPC deposited copper and rolled copper two, copper clad plate of copper foil is convex and scrutiny to from the pads and the FPC connection point out.
FPC分敷铜和压延铜两种，敷铜板的铜箔是凸出来的，细看的话能从焊盘与FPC的连接处看出来。
This paper introduces the concepts of uniform convex, uniformly normal structure and normal structure for 2-normed Spaces. It is proved that for such Spaces, the fixed point property holds.
本文给出2 -赋范空间一致凸、一致正规结构、正规结构概念，指出这类空间具有不动点性质。
After the ink tube is inserted in the pen head component, the seal film is broken by the convex tube upwards, ink flows into a pen point, and a user can write.
当储墨管插上笔头组件后，凸管顶破封膜，使墨水流向笔尖，即能书写。
We first give a new definition, the support direction of a boundary point of a convex set.
给出了集合的边界点的支持方向的新概念。
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
Constructing convex hull of planar point set is a basic algorithm in computational geometry.
求平面点集的凸包是计算几何的一个基本算法。
The processes of 3d buffer creation for point, line, face and convex polyhedron are introduced in detail in the paper.
详细论述了点，线，面和凸体的三维缓冲区生成过程。
In this paper, we will give a new type of fixed point theorem for non - self - mapping in a complete metrically convex metric space.
本文给出在完备度量凸空间上非自映射的一类新的不动点定理。
This paper investigates the existence of complex support functional of a convex function in complex linear spaces and the complex numerical ranges of the complex support functionals on a point.
采用子空间中支撑泛函延拓的方法，构造出在复线性空间任意点上的复支撑泛函；确定在同一支撑点上复支撑泛函的数值域，从而得到复支撑泛函具有唯一性的充分必要条件。
This paper investigates the existence of complex support functional of a convex function in complex linear spaces and the complex numerical ranges of the complex support functionals on a point.
采用子空间中支撑泛函延拓的方法，构造出在复线性空间任意点上的复支撑泛函；确定在同一支撑点上复支撑泛函的数值域，从而得到复支撑泛函具有唯一性的充分必要条件。
应用推荐