您要查找的是不是：
- n - dimensional finite point set n维有限点集
- The Algorithm for Convex Hull Set of Plane Finite Point Set 平面有限点集最小凸包集的计算方法
- TWO CLASSES OF GEOMETRIC INEQUALITIES OF FINITE POINT SET IN SPACE WITH CONSTANT CURVATURE 常曲率空间中有限点集的两类几何不等式
- A Property of Finite Point Sets on a Sphere and Its Application 共球有限点集的一个性质与应用
- finite point set 有限点集
- cospherical finite point set 共球有限点集
- The base that using elliptic curves as public key cryptosystem is because of the point set of elliptic curve on finite field can construct Abelian group. 使用椭圆曲线作为公钥密码体制的基础,是定义在有限域上椭圆曲线上的点构成的阿贝尔群,并且使定义其上的离散对数问题的求解非常困难。
- It is a good idea to already have your break point set in the agent code. 最好是代理代码中已经设置了断点。
- At Define access point Settings press OK . 在确定接入点设置 按下OK .
- An algorithm speedily building TIN of scattered point set is presented. 该文提出了一种针对散乱点集的快速生成TIN的算法。
- Automatic access point settings updated for some operators. 部分供应商的自动接入点设置更新。
- Let M~n be a closed smooth n-manifold, and it admits a (Z_2)~k-action with fixed point set data . 设（Z_2）~k作用于光滑闭流形M~n上，其不动点集具有常余维数（2~k-1），法丛分解为。
- Experimental results show that these methods are effective to parameterize point set surfaces. 实验和统计结果表明，文中方法是比较有效的点模型曲面的参数化方法。
- According to the characteristics of the point set tightness，a fast speed convex full algorithm is designed. 根据高密度点集物紧密性好的特点，设计了一种快速的凸壳算法；
- A general algorithm of triangulating arbitrary planar polygonal domain and scattered point set is presented. 提出了一个适用于任意平面多边形区域及散乱点集的通用三角化算法。
- The base that using elliptic curves as public key cryptosystem is because of the points set of elliptic curve on finite field can construct Abelian group. By this, the discrete logarithm on elliptic curve can be defined. 使用椭圆曲线作为公钥密码体制的基础是由于定义在有限域上的椭圆曲线上点的集合可构成阿贝尔群 ;由此可定义其上的离散对数 ;即椭圆离散对数 .
- The base that using elliptic curves as public-key cryptosystem is because the points set of elliptic curve on finite field can form Abelian group. By this, the discrete logarithm on elliptic curve can be defined. 使用随圆曲线作为公钥密码体制的基础是由于定义在有限域上的椭圆曲线上的点集合可构成阿贝尔群，由此可定义其上的离散对数，即椭圆离散对数。
- This method can parameterize point set surfaces efficiently and with a little distortion based on the stability of geodesics on point set surfaces. 该参数化方法利用测地线距离在不同分别分辨率模型上的稳定性，在保证参数化质量的前提下，很好地解决了参数化点集表面时计算量大的问题。
- The base using elliptic curves as public-key cryptosystem is that because the points set of elliptic curve on finite field can form Abelian group. By this,the discrete logarithm on elliptic curve can be defined. 使用椭圆曲线作为公钥密码体制的基础是由于定义在有限域上的椭圆曲线上的点的集合可构成阿贝尔群，由此可定义其上的离散对数，即椭圆离散对数。
- The point set (‘data’ shape) is rigidly moved (registered, positioned) to be in best alignment with CAD model (‘model’ shepe) . 点放置 (‘数据'形状) 硬的被移动 (注册的,放置) 和卑鄙的男人模型在最好的对准中。
