您要查找的是不是：
- point set constraint 点约束
- It is a good idea to already have your break point set in the agent code. 最好是代理代码中已经设置了断点。
- An algorithm speedily building TIN of scattered point set is presented. 该文提出了一种针对散乱点集的快速生成TIN的算法。
- The vector extreme problems with the set constraint in the ordered linear topological spaces are studied. The necessary and sufficient optimality conditions are established. 在序线性拓扑空间里研究了含有集约束向量极值问题的最优性条件;并建立了充分性和必要性条件.
- At Define access point Settings press OK . 在确定接入点设置 按下OK .
- Abstract： The vector extreme problems with the set constraint in the ordered linear topological spaces are studied.The necessary and sufficient optimality conditions are established. 摘 要： 在序线性拓扑空间里研究了含有集约束向量极值问题的最优性条件;并建立了充分性和必要性条件.
- 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. 实验和统计结果表明，文中方法是比较有效的点模型曲面的参数化方法。
- Automatic access point settings updated for some operators. 部分供应商的自动接入点设置更新。
- 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. 提出了一个适用于任意平面多边形区域及散乱点集的通用三角化算法。
- SQL> set constraint fk_s_tno immediate; 约束条件已设置。
- SQL> set constraint t2_fk deferred; 约束条件已设置。
- This method can parameterize point set surfaces efficiently and with a little distortion based on the stability of geodesics on point set surfaces. 该参数化方法利用测地线距离在不同分别分辨率模型上的稳定性，在保证参数化质量的前提下，很好地解决了参数化点集表面时计算量大的问题。
- The point set (‘data’ shape) is rigidly moved (registered, positioned) to be in best alignment with CAD model (‘model’ shepe) . 点放置 (‘数据'形状) 硬的被移动 (注册的,放置) 和卑鄙的男人模型在最好的对准中。
- SQL> set constraint c_fk immediate; 约束条件已设置。
- SQL> set constraint fk_s_tno deferred; 约束条件已设置。
- SQL> set constraint c_fk deferred; 约束条件已设置。
- 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. 使用椭圆曲线作为公钥密码体制的基础,是定义在有限域上椭圆曲线上的点构成的阿贝尔群,并且使定义其上的离散对数问题的求解非常困难。
- The (Euclidean) minimum weight triangulation (MWT) of a planar point set is a long-standing open problem in the fields of computational geometry and algorithm design. 平面点集的 (欧几里德 )最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题 .
