查询词典 convex polygon

By decomposing each polygon into a set of several individual convex sub-polygons and constructing the map between the two sets, this method can solve the metamorphosis problem of two polygons which have not same topology(including concave polygon and holey polygon).

解决了任意非同拓扑结构的变形问题。

In this paper, an arbitrary edge in the plane of the convex polygon generating algorithm, discussed the randomly generated convex polygon vertex algorithm idea.

本文研究在平面中生成任意边的凸多边形的算法，讨论了随机生成凸多边形顶点坐标的算法思想。

Considering the triangulation algorithm based only on the determination of convex-concave vertices is restricted to simple polygons, this paper presents a triangulation algorithm for the general plane polygon GTP(General Triangulation of Polygons) based on determination of convex-concave vertices and connecting the outer border of a polygon with its inner borders.

摘 要：针对基于凹凸顶点判定的三角剖分算法适用范围有限的缺点，提出了将凹凸顶点判定与连接多边形内外边界相结合的适用任意平面多边形的三角剖分算法GTP(General Triangulation of Polygons)。

Two new rules represented in equality for Demyanov difference: the Demyanov difference of summations of two pairs of convex compact complementary sets;the Demyanov difference of a set, which is the convex hull of finite number of convex compact sets, and a convex compact set complementary to these sets,are given.

为此给出了两个关于Demyanov差的新的用等式表述的运算法则：两个彼此互补的凸紧集对的和的Demyanov差，有限个凸紧集的凸包和与这些凸紧集正交互补的凸紧集的Demyanov差。

Based on the previous work of other researchers, we presented the definition of global convex: a surface is globally convex if it happens to be the surface of a convex body or part of the surface of a convex body.

曲面微分几何，总结了自由曲面形状分析技术手段，对著名CAD软件中曲面分析工具特点进行了简要分析，指出了它们对曲面全局形状分析能力的不足。

Tan and Xu [1] had proved the theorem on convergence of Ishikawa iteration processes of asymptotically nonexpansive mapping on a compact convex subset of a uniform convex Banach space , Then Liu Qihou [3] presents the necessary and sufficient conditions for the Ishikawa iteration of asymptotically quasi-nonexpansive mapping with an error member on a Banach space convergent to a fixed point . Xu and Noor [5] had proved the theorem on convergence of three-step iterations of asymptotically nonexpansive mapping on nonempty closed, bounded and convex subset of uniformly convex Banach space.

Tan和Xu已经证明了建立在一致凸Banach空间紧凸子集上的渐进非扩张映射的Ishikawa迭代序列的收敛原理，随之，刘齐侯又阐述了Banach空间上渐进准非扩张映射T的具误差的Ishikawa迭代序列收敛于T的不动点的充分必要条件；之后，Xu和Noor也证明了定义在一致凸Banach空间某非空有界闭凸子集上的渐进非扩张映射的三步迭代序列的收敛原理。

In elliptic case,the compactness of"convex polyhedrons"is destinedto be true because of the"local Lipschitz continuity of convex functions",whilein parabolic case,we cannot expect convex-monotone functions have such goodproperties as convex functions.

在广义解存在性的证明中，参考椭圆情形由"凸多面体"逼近的思想，我们采用了由一种特殊构造的"凸单调多面体"逼近的途径，但在证明这种凸单调多面体族的紧性时，我们遇到了困难。

Systems of inqualities,the minimum or maximum of a convex function over a convex set,Lagrange multipliers,and minimax theorems are among the topic treated,as well as basic results about the structure of convex sets and continuity and differentiability of convex functions and saddle-functions.

其中对不等式系统、凸集上的凸函数的极小或极大、拉格朗日乘子和极小极大定理做了专题论述，同时对凸集的结构和连续性以及凸函数的可微性和鞍点函数的基本结果做了介绍。

A new polygon filling method——polygon trapezoidal decomposition filling method——is put forward and realized. An analytical comparing between its time complexity and that of the classical methods shows that it is faster than scan-line algorithm in the case of complex concave polygon.

提出了一条新的多边形填充思路——多边形梯形网格剖分填充法，实现了该算法并将其时间复杂度与经典的有序边表算法进行了比较，说明该方法在复杂的凹多边形情况下处理速度较有序边表快。

With the new method, a simplified polygon can obtained following two steps, filleting the original polygon and transforming the filleted shape to a polygon.

这种方法先对原多边形进行弧化，然后将弧化后的模型还原为直线边界的多边形，就得到了简化的图形。

The circulation, consumption and reproduction of the trilogy have not only testified to its historical significance and literariness, but also invested it with new meanings.

该三部曲的流通、消费与再生产不仅验证了其历史意义及文学性，而切还赋予它以新的意义。

If he thought that he could buy me off, he would be wrong.

如果他认为他可以收买我，那他就大错特错了。