intersection point造句
例句与造句
- This introduces some errors , e . g . , a subsequent test will tell you that the intersection point does not lie on either of the two lines that create it in the first place
这些对象的最大特点是它的端点或顶点的坐标都是整数，便于利用计算机对它进行处理，这是因为，计算机对整数的运算和表示不会产生错误。 - In this paper the c cutter radius compensation has been accomplished . it needs to compute the intersection point of two motion lines ; therefore , the next motion code must be picked out
本课题要实现的刀具补偿为c型刀具补偿,由于c型刀具补偿需要计算两段运动轨迹的相交点,所以必须提前提取下一段运动段代码。 - Abstract : with the modification of intersection point attribute and application of the depth data about graphic , it defines the vertex properties and puts forward a hidden method oriented to point distinguishing
文摘:应用图形元素的深度值信息，并通过对交点属性值的修改，确定被遮挡零件的顶点属性，提出了方向点判别消隐法。 - 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
本文在实现空间两点间曲线距离的测量时，设计了一种新的数据存贮结构，解决了杂乱交点的排序这一难题，提高了测量速度。 - In the previous radar / arpa simulator , both radar echoes and arpa marks are generated with the algorithm of computing intersection point with scanline sweeping ( abbreviated to acipss ) , this does ' t accord with the mechanism of radar working
在以前的雷达/ arpa模拟器中，雷达回波和arpa符号都采用扫描线求交算法生成，这不符合真实雷达的工作机制。 - It's difficult to find intersection point in a sentence. 用intersection point造句挺难的
- Lastly , a new efficient technique for finding and computing intersection points is presented . as we know that finding and computing of intersection points is a main procedure , it makes the speed of the algorithm more higher
最后，本文采用了一个新的具有最少计算量的交点判断和计算方法，由于判断和计算交点是裁剪算法的主要工作，从而进一步加快了算法的运行速度。 - Different from realms , dual grid adopts finite precision rational coordinate system , which can express intersection points exactly . therefore , the complexity of spatial redrawing can be avoided , and spatial management subsystem can be implemented easily
与realms不同，双网格使用了有限精度的有理数坐标系统，能够准确表示线段的交点，从而避免了复杂的空间调整，使空间管理子系统易于实现。 - To analyze the different locations of the intersection of a ray and a polygon quickly , a scheme of calculating the number for the intersection point is established based on the structure query language ( sql ) and the method of weighting each side of the polygon
摘要采用对多边形各边赋权值的方法，分析射线与多边形相交的不同情况，给出了使用结构化查询语言实现交点个数求解的快速解决方案。 - It supposed that the circle of sliding surface run through the foot of slide . the factor of safety is transmitted to the function of x coordinate of the intersection point of the tangent at the scrap of the circle and x axis . so , the two - dimension area of searching is changed to one - dimension
该方法先固定潜在滑动圆弧的上、下边界点，利用滑弧后缘处的切线与x坐标轴交点的位置确定了滑弧的曲率，将二维搜索面域简化为一维搜索线域，搜索的上、下限有严格的界定，不存在漏点问题。 - This paper emphatically researched the problem how to calculate the intersection point between workpiece that rotated with variational angle velocity and milling cutter that moved with complicated track and rotated with high speed . furthermore it adopted the discrete curve surface method for every milling cutter , and treated image frame as the control parameter of position of milling cutter during the intersection calculation process , so the algorithm of intersection between workpiece and milling cutter was obtained . the paper also discussed further three - dimension graphic problem of manufacture process
文中对做变角速度运动的工件和运动轨迹复杂的高速自转中的铣刀求交问题进行了重点研究，采用将铣刀上的每个刀尖划出的曲面离散化的方法，以图像显示的帧数作为求交计算过程的铣刀位置的控制参量，得出了铣刀与工件的求交算法。 - The paper applies algebraic geometry , computational geometry , approximation theory to study the following problems : the nother type theory and the riemann - roch type theory of the piecewise algebraic curve ; the number of real intersection points of piecewise algebraic curves ; the real piecewise algebraic variety and the b - net resultant of polynomials
本文应用代数几何，计算几何，函数逼近论等学科的基本理论，分别就分片代数曲线的n ( ? ) ther型与riemann - roch型定理；分片代数曲线的实交点数；实分片代数簇以及多项式的b -网结式进行研究。 - The problem is researched and the algorithm which calculates the intersection points of two graphs created by the same coefficient of the ifs is proposed . the curve described changing of the intersection points number is drawn . the conc lusion is that the curve fluctuates in the tiny range and is smooth when it is seen as a whole
其次，针对同一ifs迭代码两次迭代绘制得到的分形图并非完全相同这一问题展开研究，提出了ifs分形覆盖相交交点变化曲线的概念，给出了覆盖相交交点变化曲线的绘制算法，在此基础上进一步研究了分形覆盖相交交点变化曲线的变化率情况，得到了分形覆盖相交交点变化曲线宏观上比较光滑，但实际上小范围内异常波动的实验结果。 - A variable is sampled in a certain increment , and introduced into the equations . there are two sets of any two equations to be solved . the real solutions of the two sets are protracted in spatial coordinate system to obtain two curves , so that the intersection points of the two curves can be found as the solution of the original equations
针对所得三元高次多项式方程组，采用数学分析软件mathematica编制程序，以一定的步长增量，在一定范围内取一个变量的值，并将其代入方程组中，求解其中一个方程分别与另外两个方程联立的方程组的解，将得到的实数解绘制成两条空间曲线，其交点即为原三元方程组的解。 - Moreover , based on in - depth research of " the existing scan - line polygon fill algorithm , the author has introduced a new fast method for clipping arbitrary boundary areas algorithm which uses the edge consistency and the scan - line consistency and adopts sorted chain table , i t can reduce the quantity of calculating intersection points and improve the efficiency of algorithm
另外，作者在对已有的扫描线填充算法深入研究的基础上，介绍一种利用裁剪区域的边的连贯性和扫描线的连贯性，从而减少求交计算量、提高算法效率的有序链表的快速裁剪算法。 - 3 . by using the techniques of an explicit criterion to determine the number of real roots of a univariate polynomial in ( [ 13 ] , [ 73 ] ) ; b - net form of bivariate splines function ; discriminant sequence of polynomial ( cf . [ 13 ] , [ 73 ] ) and the number of sign changes in the sequence of coefficients of the highest degree terms of sturm sequence , this paper determines the number of real intersection points two piecewise algebraic curves whose common points are finite . a lower bound of the number of real intersection points is obtained in terms of method of rotation degree of vector field
大连理工大学博士论义：分片代数价线i片代数簇的若十m穴3 ：利用杨路，张景中，侯晓荣在文献v13 ， 73 ）中关于一元多项式实根的显式判准，以及二元样条函数的b网形式，多项式的判别序列和sturm序列的最高次数项系数序列的变号数，本文给出了两个分片代数曲线的丈交点数（假设公共点是有限的）的计算公式。