查询词典 line segment

The diffraction theory of Kirchhoff is applied to the four-pinhole aperture diffraction screens, the intensity, the zero-contour of the real and imaginary parts of complex amplitude and the phase distribution in deep Fresnel diffraction region are simulated, and it is found that the bright spots in interference field show central symmetry distribution. When the observation plane close to the diffraction screen, the zero-value points of light intensity can form line segment, on which the eccentricities of the light intensity isoline are close or equal to 1, the intensity changes very fast on both sides of the zero-line of light intensity.

利用基尔霍夫衍射理论计算了四圆孔径衍射屏在菲涅尔深区形成的的干涉光场的强度、零值线和相位的分布，发现干涉光场亮斑关于中心呈对称分布，在距离衍射屏较近的观察面上，光强值为的零点组成光强零值线段，该线段上光强等值线的离心率都接近或等于1，其两侧的光强值变化非常剧烈。

This result is visualized and further compared with the results based on line segment and circular curve-line error models.

以三次B样条曲线为例，给出了其建模及可视化结果，进一步地将该结果与折线及圆曲线的情况进行了比较。

Any graph's cliping attributes to line cliping finally.It commonly used three kinds of line segment cliping algorithms that mainly included the Cohen-Sutherland algorithm, the midpoint of division algorithm and Liang－Barsky algorithm.

任何图形的裁剪最终都归结于直线段裁剪，常用的直线段裁剪算法主要有Cohen—Sutherland算法、中点分割算法及梁友栋一Barsky算法三种。

The conventional Hough transform can only count the number of feature points which are collinear, and can't record the end points of a line segment and its length. Thereby, this paper present an improved Hough transform to overcome these two shortcomings. The algorithm is parallelized and implemented in MCC. What's more, we give a parallel algorithm to identify and eliminate overlapping line segments. These advantages are very useful in the real applications.

本文针对传统Hough变换只能统计直线上黑色象素个数，不能记录线段的两端点坐标及长度的缺点，介绍了一种改进Hough变换算法，并在网孔处理机阵列中实现，还给出了能够识别并消除重复线段的并行算法，这些在实际问题中是很有用的。

For improving the algorithm, the text started with analyzing the plus or minus characteristic of a straight line, further described roundly various mutual positions relation between the point and the directed line segment and the corresponding disposing process.

为改进算法，首先从分析直线的正负性入手，进一步全面描述了点与有向线段的各种相互位置关系及相应的处理步骤。

For the studies of GIS uncertainty, error band model of a line segment is one of the current focus issues, which reason is not only that there are many open questions for the uncertainty of line segment but also that the uncertainty of line segment is the base of both the uncertainty of the surface element and GIS spatial analysis.

对GIS不确定性的研究来说，线元不确定性的研究是一个重点，因为线元不仅是面域不确定性的基础，其本身也是GIG叠置分析、缓冲区分析和空间地址配对分析等的基本元素。

Secondly, the analytic expressions of the error band boundary line for the s model of line segment are deduced, the parameter equations of the error band boundary are gotten.

考虑实用性和合理性，将线元看成离散点的集合，将线的不确定性看成点的不确定性的聚合体，将线元的位置不确定性模型看成以各点误差椭圆的长半轴E为半径的误差圆的聚合体，建立了以线元上任意点处的误差椭圆的长半轴E为带宽的线元不确定性ε模型。

An ordinary definite integral is defined over a line segment, whereas a line integral may use a more general path, such as a parabola or a circle.

普通定义的积分是定义在一段线段上的，而线积分则用更一般的路径，像拋物线或圆。

The word can also apply to a straight line or to a series of line segment s linked end to end.

这个词也适用于直线或一连串互相连接的线段。

Thirdly, the principal curve and polygonal line algorithm are introduced, and an implementation of polygonal line algorithm based on Quasi-Newton numerical optimization is illustrated. The simulation results show that when this algorithm isused in the detection of curvilinear defects on wafer map, it can converge fast, compute accurately and meet the demand of application of defects pattern analysis, and with the number of line segment increasing, the polygonal line will approximate to the Kegl principal curve.

研究了主曲线、多边形线算法，提出用多边形算法识别弧状缺陷想法，讨论了用拟牛顿法实现该算法的解决方案，针对硅片缺点模式分析中常出现的弧状缺陷，采用该算法进行检测分析，实验结果表明这种算法快速准确，当线段个数或最小距离平方期望值达到一定门限值后，多边形线就已经能够描述弧状缺点集的形状，随着线段个数增加，最小距离平方期望值还在不断下降，最终会收敛到Kegl主曲线。

The absorption and distribution of chromium were studied in ryeusing nutrient culture technique and pot experiment.

采用不同浓度K2CrO4(0，0.4，0.8和1.2 mmol/L)的Hoagland营养液处理黑麦幼苗，测定铬在黑麦体内的亚细胞分布、铬化学形态及不同部位的积累。

By analyzing theory foundation of mathematical morphology in the digital image processing, researching morphology arithmetic of the binary Image, discussing two basic forms for the least structure element: dilation and erosion.

通过分析数学形态学在图像中的理论基础，研究二值图像的形态分析算法，探讨最小结构元素的两种基本形态：膨胀和腐蚀；分析了数学形态学复杂算法的基本原理，把数学形态学的部分并行处理理念引入到家实际应用中。