交点的的英文

• nodal
• nodical

• "交点"英文翻译    crossover point; intersectio ...
• "的"英文翻译    4次方是 The fourth power of 2 i ...
• "齿冠到交点的距离" 英文翻译 :    crown to crossing point distance
• "交点" 英文翻译 :    1.[数学] crossover point; intersection; intersection point; point of intersection; cusp2.[天文学] node 交点月 [天文学] draconitic month; condical month
• "点的" 英文翻译 :    punctual
• "成交点" 英文翻译 :    commercial base
• "对交点" 英文翻译 :    antinode
• "副交点" 英文翻译 :    auxiliary intersection point
• "共点，交点" 英文翻译 :    common point
• "降交点" 英文翻译 :    [航空] descending node; southbound node
• "交点法" 英文翻译 :    intersecting point method; intersection method; method of intersection
• "交点年" 英文翻译 :    draconitic year; year#astronomical years
• "交点线" 英文翻译 :    line of nodes; nodal line
• "交点月" 英文翻译 :    draconic month; draconitic month; dracontic month; nodical month
• "交点周" 英文翻译 :    draconitic revolution
• "零交点" 英文翻译 :    zero-crossing
• "升交点" 英文翻译 :    ascending node; dragons head; node; ascending; northbound node
• "提交点" 英文翻译 :    commit point
• "相交点" 英文翻译 :    crosspoint; point of intersection
• "虚交点" 英文翻译 :    imaginary intersection point; inaginary intersection point
• "正交点" 英文翻译 :    orthogonal points
• "直交；交点" 英文翻译 :    intersection
• "转交点" 英文翻译 :    intersection point
• "交点月交点月" 英文翻译 :    nodical month
• "结点的, 叉点的" 英文翻译 :    crunodal

• This algorithm simplified the calculational methods of point of intersection and improved system speed
  算法在交点的计算上进行了简化，提高了计算速度。
• All kinds of method used around world and presented approach based on interval arithmetic and quad tree was presented
  总结了消除偏置曲线自交点的各种算法的优缺点，提出了基于区间算术和四叉树的算法。
• A new geometric multisensor data association method according to the centralizing level of sensors " line of sight is given
  从几何角度提出了根据传感器视线交点的密集程度进行多传感器数据关联的方法。
• If the miter length of the join of the intersection exceeds the limit of the join , then the join will be beveled to keep it within the limit of the join of the intersection
  如果交点的斜接联接长度超过联接限制，则联接将被倾斜以便落在交点的联接限制范围内。
• The main mathematical formulae are : ( the equation is abbreviated ) and ( the equation is abbreviated ) , ( the equation is abbreviated ) and function of draw line : ( the equation is abbreviated )
  得到交点的座标为： （方程式略）点的中心位置公式： （方程式略）以及画线函数公式： （方程式略） 。
• A new data storage structure is designed to resolve the difficulty in arrangement of unorderly intersection points and accelerate the measuring process during curvilinear distance between two points measuring
  本文在实现空间两点间曲线距离的测量时，设计了一种新的数据存贮结构，解决了杂乱交点的排序这一难题，提高了测量速度。
• Effective scanning line algorithm was designed ; divided scan path was used , and extract scanning line vector to area filling . it can be concluded that this algorithm increases manufacturing velocity and accuracy
  文中设计了有效的扫描线与多边形边的求交算法，保证了交点的正确配对；采用分区域扫描策略，提取同区域的扫描矢量完成了扫描，使成型速度与精度都有所提高。
• In order to find the location of the cross points in the image , we first obtain the equations of the lines in the image plane by using hough transform and then get the cross points of the lines . the result of the camera calibration using this method is more accurate
  在计算定标点的图象坐标时，我们采用了哈夫变换的方法求出定标方格图上格线的方程，然后再求格线交点的图象坐标，从而使定标的参数更准确。
• Because this algorithm makes the small triangular face normal to be a byproduct of calculating point of intersection , it does not need other time to calculate it . so it is possible to display high quality realistic pictures smoothly on microcomputer
  尤其是该算法计算切削后生成的小三角片的法向量成为计算交点的一个副产品，几乎不再占用额外的计算时间，为做到平滑地动态显示高质量的真实感图形提供了可能。
• Secondly , the problem of the curve - surface mutual transforming and smooth - finishing have been analyzed farther . for the surface intersecting problem : owing to the introduction of the boundary points , as long as the intersecting points on a certain line , the full intersecting line can be gained . the intersecting line either intersects at the boundary of the triangle surface or forms the loop ; during the course of tracking , the selecting of the pace is restricted by the curvature , the number of the gained intersecting points are not in proportion as the chord - length ; the intersecting points not only record the coordinate and store the parameter
  对两曲面求交问题，当曲面细化足够小时，曲面求交可近似看成曲面与平面相交问题，引进了边界点的概念，因此只要知道交线上的任意点，就可以将跨越许多曲面片的整条交线计算出来，所求出的交线或者跨越曲面的边界，或者形成交线环；从初始点出发跟踪求解整条交线的过程中，步长的选择采用了通过曲面片曲率来约束的方法，用该方法求出的交点在不同曲面片上的分布数目不与弦长成正比；该求交方法包含了各曲面片的边界线与交线的交点的求解，可获得边界交点的坐标值及其参数值。