The euclidean 2 - connected steiner network problem is to determine the minimum - weight 2 - connected steiner network on a given set of points in the euclidean plane 设p是欧几里德平面上的一个有限点集， n是顶点集为v ，边集为e的一个网络，如果p
For the sake of the convenience in realistic application , we deduced some criteria for chaos existence with uniform norm such as euclidean norm and 1 - norm 在本章最后，我们给出了类似于马罗陀定理的另一条关于混沌的判据- -排斥异宿子意味着混沌
The euclidean distance is usually chosen as the similarity measure in the conventional k - means clustering algorithm , which usually relates to all attributes 传统的k -均值算法选择的相似性度量通常是欧几里德距离的倒数，这种距离通常涉及所有的特征。
13 kim d - s , cho y , kim d . euclidean voronoi diagram of 3d balls and its computation via tracing edges . computer - aided design , 2005 , 37 : 1412 - 1424 在这种情况下，我们的算法与传统算法不同，它能有效的计算多个connolly表面而不用重新计算原子的voronoi图。
Given the voronoi diagram of atoms based on the euclidean distance from the atom surfaces , the proposed algorithm first computes a - beta - shape with an appropriate probe 由于一个氨基酸由一组原子组成，一种蛋白质可以由表示为原子的一组三维刚性球来建模。
In this paper , the objects that we research are spatial geometry in three - dimensional euclidean space . the definitions of spatial objects conform to opengis specification 本文的研究以三维空间几何体为研究对象，空间对象的定义符合opengis规范的要求。
The tcq algorithm takes advantage of convolution code , and enlarges the euclidean distances among quantized data by expanding data dimensions Tcq算法充分利用了卷积码的特性，采用信号空间扩展的方法来增大量化信号的欧式距离，从而达到提高量化性能的目的。
12 kim d - s , cho y , kim d et al . , kim s , bhak j , lee s - h . euclidean voronoi diagram of 3d spheres and applications to protein structure analysis 通过预测蛋白质配体复合体的天然结构， connolly表面也可以用来为解决蛋白质之间及蛋白质与配体之间嵌合问题提供便利。
