助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   多边形的边 的翻译结果: 查询用时:0.008秒
图标索引 在分类学科中查询
所有学科
更多类别查询

图标索引 历史查询
 

多边形的边
相关语句
  “多边形的边”译为未确定词的双语例句
     The time complexity of the algorithm is proved to be O(n2) , where N is the number of edges of the original polygon.
     最后证明了运算法的时间复杂性为O(N~2),其中N为原多边形的边数。
短句来源
     The theorem and the related results provide a simple,visual,geometrical way for designers to describe the distribution of inflection points on a Bezier curve just according to the shape of its control polygon.
     本文的定理和结论具有直观的几何意义 ,能使我们直接从 Bezier曲线的控制多边形的边向量的形状来判断曲线的拐点的情况。
短句来源
     Based on the NUBLINE software,it illustrates the algorithm of generating and modifying surface shape of ship hull that consists of Nonuniform B-spline Curves and also demonstrates the way to compute the Nonuniform knot vectors,insert knots,recalculate the values of control points and the tangent vectors of Nonuniform B-spline.
     首先,讨论了利用曲线的分段连接点与控制点或控制多边形的边对应关系,确定非均匀B样条节点矢量的方法,从而解决了用非均匀B样条生成型线的先决问题; 其次,提出了K次非均匀B样条曲线的节点插值方法,并讨论了在非封闭曲线和封闭曲线条件下如何反算样条曲线控制点的数学方法;
短句来源
     In accordance with the above conclusions, the algorithm was designed in which time complexity was O(n4) for generating the smallest quadrangle encasing box of convex polygon. It showed that the quadrangle encasing box of convex polygon can be constructed on the basis of the algorithm. The time complexity of the algorithm was polynomial series concerned with the edges of the convex polygon.
     依据此结论设计了时间复杂度为O(n4)的算法,依据本算法可以构造出凸多边形面积最小的凸四边形包围盒,而且其算法的复杂度仅与凸多边形的边数n相关,是多项式级的复杂度.
短句来源
     The algorithm complexity is o(n·ln m), and accelerates the test for n<
     由于曲边数远小于逼近多边形的边数n·m,该算法时间复杂度仅为o(n·lnm),加快了检测速度。
短句来源
  相似匹配句对
     The Construction Edge by Edge a Convex Polygon with Fixed Perimeter
     固定周长凸形的构造
短句来源
     Upper Bounds on the Size of Inner Voronoi Diagrams of Multiply Connected Polygons
     多连通形的内部Voronoi图的顶点和数的上界(英文)
短句来源
     Edge Coloring of Planar Graphs
     平面图的染色
短句来源
     The weight of a edge is denoted by w(e).
     W(e)表示e的权。
短句来源
查询“多边形的边”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


The displacement equations which are troublesome to establish are often used in kinematic analysis and synthesis of the. linkage. As a general rule, it is required to list many equations which involve squared distances between the verticles of spatial or Planar vector polygon, and to expand the squares of many polynomials in the. equa tions. The calculation mentimed above is very complicated. Consequently, people are liable to errors. The cosine formula presented in this paper can make you obtain the result...

The displacement equations which are troublesome to establish are often used in kinematic analysis and synthesis of the. linkage. As a general rule, it is required to list many equations which involve squared distances between the verticles of spatial or Planar vector polygon, and to expand the squares of many polynomials in the. equa tions. The calculation mentimed above is very complicated. Consequently, people are liable to errors. The cosine formula presented in this paper can make you obtain the result of previous calculation in a short span-of time without formal deduction. This article also gives some examples to establish the displacement equation of input link and output link in the linkage.

在连杆机构的运动分析和综合中,为了建立输入杆同输出杆的位移方程,常常把机构简图画成矢量多边形,并进行以下的演算。先列出多边形上i、j二个顶点在某直角坐标系上的六个坐标(x_i,y_i,z_i;x_j,y_j,z_j)的代数式,再将它们代入二点距离(l_(ij))的平方公式l_(ij)~2=(x_i-x_j)~2+(y_i-y_j)~2+(z_i-z_j)~2;最后展开上式并作整理和化简。演算工作,因多边形的边数和各矢量的指向不同而逐一进行,既复杂而又容易出差错。因此,避免上述的列式和演算,用一个直接公式迅速写出所需要得到的结果,是一个值得研究的问题。本文提出的多边形余弦公式(简称余弦公式)可作为解决这个问题的普遍公式。文中附有若干个用余弦公式直接求连杆机构连架杆的位移方程的例题。

This paper explains how to approximate function f(x)with Be-rnstein polynomial.Both of them have the same properties of monotony and conc-avity and convexity,so it ls convenient to use them to design geometric

本文介绍了用Bernstein多项式来逼近函数f(x),它们具有同样的单调性及凹凸性,所以十分便于几何外形设计.Bézier利用Bernstein多项式良好的几何逼近性质,定义了Bézier曲线的两种形式:即用特征多边形的顶点表示的和用特征多边形的边表示的.本文推出用矩阵形式表示的Bézir曲线,并推导几个低次的Bézier曲线.

An Algorithm for finding convex decomposition of simple polygons is described. This algorithm finds the convex hull of a simple polygon and then recurses to find the convex hull of the original region and itsconvex hull until such regions are convex. The time complexity of the algorithm is proved to be O(n2) , where N is the number of edges of the original polygon.

本文说明一种把简单多边形分斛成凸多边形的差形式的组合的算法。该算法在求一简单多边形凸包的同时求出凸包和原多边形的差(把差称为内多边形),再对内多边形递归地作同样计算便可得到最终结果。最后证明了运算法的时间复杂性为O(N~2),其中N为原多边形的边数。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关多边形的边的内容
在知识搜索中查有关多边形的边的内容
在数字搜索中查有关多边形的边的内容
在概念知识元中查有关多边形的边的内容
在学术趋势中查有关多边形的边的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社