计算距离 meaning in English
computed range
computedrange
estimated range
Examples
- 5 yulin zhou , pengrong xiong , hong zhu . an improved algorithm about the closest pair of points on plane set . computer research and development , 1998 , 35 : 957 - 960
这样，在归并时,最坏情况只需要计算3n 2对点对之间的距离，从而使整个算法计算距离的复杂度降为3n lg n 2 ,这个值为最初sh算法的一半。 - The project has realized the interactive map and makes the map link to database , in order to realize the fast search and show the local information of the inquired spot , the project can calculate the distance and area
该方案的特点是实现了互动地图,使地图与数据库资料相连结,达到快速搜索及显示查询点信息、可计算距离、面积等。 - In 1998 , zhou , xiong and zhu improved sh algorithm by reducing this complexity to 2n - lg n . in this paper , we make further improvement . the overall complexity of computing distances is reduced to 3n - lg n 2 , which is only half that of sh algorithm
但是距离的计算量相对于其他基本代数或者逻辑操作来说开销比较大,所以如何降低整个算法过程中距离的计算次数成为我们考虑的重点，我们改进的目标就是使得计算距离的复杂度尽可能的小。 - 31 press w h , teukolsky s a , vetterling w t , flannery b p . numericalrecipes in c : the art of scientific computing . cambridge universitypress , second edition , 1992 . 32 dana k j , van ginneken b , nayar s k , koenderink j j . reflectanceand texture of real world surfaces
实验包括训练和测试两个阶段，在训练阶段，我们计算了所有类的zernike矩不变因子，计算完相关函数的集合之后，我们计算了10阶以内的仿射正则化zernike不变因子,构建了zernike矩不变因子矩阵，用来计算距离函数d 。 - In one process of combination , the euclidean distances between 3n pairs of points need to be computed , so the overall complexity of computing distance is then 3n - lg n . since the computation of distance is more costly compared with other basic operation , how to improve sh algorithm from the aspect of complexity of computing distance is considered
对带左半部分内的每个点，算法需要考虑带右半部分内的至多6个点，假设平面上点的个数为n ,该算法在归并时最坏情况下需要求出3n对点对之间的距离，从而整个算法计算距离的复杂度为3n lg n 。