| 1. | A fast progressive surface reconstruction algorithm for unorganized points
散乱数据点的增量快速曲面重建算法 |
| 2. | An algorithm of searching topological structure from 3d unorganized points
寻找三维散乱数据点拓扑结构的一种算法 |
| 3. | Weighted combination interpolation by piecewise quadric polynomial to scatter data points
散乱数据点分片二次多项式加权平均插值 |
| 4. | Presents an algorithm of triangle mesh generation of disperse data points based on dynamic circles
提出了一种基于动态圆的散乱数据点的三角网格生成算法。 |
| 5. | A new algorithm is presented in this paper for piecewise quadric b - splines curve reconstruction from scattered data in a plane
摘要基于控制顶点扰动的思想提出了一种新的曲线重构算法，用于构造一条分段二次b样条曲线来逼近平面上的散乱数据点。 |
| 6. | Based on the theory of space dividing using envelopment - box , an algorithm to search topological relationship from 3d unorganized points is proposed in this thesis
本文提出了一种利用包围盒空间分割方法对散乱数据点点云进行空间分割进而寻求拓扑关系的方法。 |
| 7. | A method is used to approximate several differential properties , including mean curvature , guassian curvature and main curvature on scattered - point - sampled surfaces
摘要提出一种直接在散乱数据点云上计算曲面的局部微分性质，包括平均曲率、高斯曲率和主曲率。 |
| 8. | Some instances indicate that this algorithm has greatly promoted the speed of using scatter data points to finish surface reconstruction , and really reconstructed surface model
通过实例表明该算法大大加快了散乱数据点群的重构速度，而且能够较为真实的重构出曲面模型。 |
| 9. | 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
算法采用可以控制大小的邻域作为空间散乱数据点的拓扑关系的几何描述，为网格划分和点的法向量的几何描述提供了必要的动态几何信息。 |
| 10. | The proposed algorithm is capable of handling with kinds of point clouds data , such as three dimensional unorganized point clouds , point clouds acquired from organized cad models or point clouds acquired from finite element analysis meshes
本文所提出的算法可以处理各种数据点云,包括三维散乱数据点云、规则cad模型离散后所获得的数据点云和由有限元网格采集到的数据点云。 |
