您要查找的是不是：
- unorganized point set 散乱点集
- A region-growing algorithm was proposed to reconstruct triangular meshes from unorganized point cloud. 摘要提出一种对无规则点云进行三角网格重构的区域增长算法。
- The algorithm is based on an incrementally expanding Neural Network and the statistical analysis of its learning process for an unorganized point cloud. 首先应用神经网络的方法对点集模型进行学习，根据在学习过程中神经网格法线的变化情况，找到特征点。
- A rapid incremental surface approximation algorithm is proposed to establish B-spline surface from the unorganized point cloud.The algorithm is composed of four steps. 摘要针对用接触式三维点数据获取设备快速输入的物体表面散乱点云数据，提出了增量式B样条曲面快速逼近算法。
- 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的算法。
- At Define access point Settings press OK . 在确定接入点设置 按下OK .
- Go all through the unorganized points, and distribute it to a small interspace box according to its three coordinates. 遍历所有散乱数据点，按照其三个方向上的坐标分到其所在的空间格内。
- 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. 实验和统计结果表明，文中方法是比较有效的点模型曲面的参数化方法。
- The basic process and several typical algorithms of surface reconstruction from unorganized points are introduced first, then the procedure and research range are defined. 本文首先介绍了散乱点曲面重建的基本过程及各种方法，明确了散乱点曲面重建的步骤及研究范畴；
- According to the characteristics of the point set tightness，a fast speed convex full algorithm is designed. 根据高密度点集物紧密性好的特点，设计了一种快速的凸壳算法；
- Automatic access point settings updated for some operators. 部分供应商的自动接入点设置更新。
- A general algorithm of triangulating arbitrary planar polygonal domain and scattered point set is presented. 提出了一个适用于任意平面多边形区域及散乱点集的通用三角化算法。
- We use a size changeable adjacent field to describe the topological structure of 3D unorganized points in our algorithm.It can offer essential dynamic information for tessellation and points" normal. 算法采用可以控制大小的邻域作为空间散乱数据点的拓扑关系的几何描述，为网格划分和点的法向量的几何描述提供了必要的动态几何信息。
- Strategies for surface reconstruction have proceeded in two main directions:reconstruction from unorganized points and reconstruction that exploits the underlying structure of the acquired data. 对于表面的重建策略已经在二个主要的方向着手进行:来自不组织的点和开发已取得数据的在下面结构的重建的重建。
- 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) . 点放置 (‘数据'形状) 硬的被移动 (注册的,放置) 和卑鄙的男人模型在最好的对准中。
- 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. 平面点集的 (欧几里德 )最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题 .
