建立了散乱点云数据之间的拓扑信息，对点云数据进行三角剖分重构网格曲面模型。
After establishing the topology relationship of scattered points, the mesh surface model of point data is reconstructed by triangulation.
提出一种对无规则点云进行三角网格重构的区域增长算法。
A region - growing algorithm was proposed to reconstruct triangular meshes unorganized point cloud.
利用数学归纳法证明算法对任意多个离散点三角形网格剖分的正确性，并通过试验验证了算法的可行性。
The mathematical induction is used to prove the correctness of the algorithm towards the triangle mesh of random multi-points, and the experiment proves its feasibility.
提出一种新的由点云数据生成三角网格曲面的区域增长算法。
A new region-growing algorithm is presented for triangular mesh surface reconstruction from point-cloud data.
在定位的基础上拟合脊柱中心线并建立测点集，应用MC算法输出三角网格模型，重建出脊柱中心曲面。
On the basis of the spine and fitting the centerline of spine, MC algorithm is used to output triangular mesh model to reconstruct the spine center surface.
对构筑三角形网格建立数字地形模型进行了研究，给出了基于散乱点和边建立三角形网格地形模型的生成算法和数据结构。
Generation of triangular meshes for digital terrain model is studied, the triangulation algorithm of discrete points and edges and its data structure are presented.
本文算法首先对立体图像对中的左图像进行DT网格剖分，把各三角形的顶点作为“特征点”在右图像中寻找它们的匹配点。
The algorithm first describes the left image with DT mesh. As feature points, the vertexes of triangulations are matched in the right image for finding their corresponding points.
散乱点的三角网格剖分是反求工程中首要环节。
Triangulation of scattered points is the first important section during the reverse engineering.
本文提出了一种基于局部信息的区域扩张算法(LIBRG)，用以解决由离散点云重构三角网格面的问题。
This paper presents a Local Information Based Region-Growing (LIBRG) algorithm, which is supposed to solve the problems of surface triangulation reconstruction from scattered points.
重点研究了BE M中三角网格剖分方法，提出了过约束点的剖分算法。
BEM triangulation mesh generation method was mainly investigated and further proposed a mesh generation algorithm through restriction points.
该法适用于区域内点、围绕边界的尖角点、边界或内部同心圆弧及同心圆四种特殊区域的网格改进，为实际工程结构应力梯度突变或变化较大处网格细化提供了十分方便的手段。
The scheme adapts to refine the meshes of special regions, such as interior points, around corner points, arcs and circles, which are usually failure regions of parts because of great stress gradient.
我们提出了两个个实际的线性时间的算法求解三角网格上一点开始沿给定切方向的最直测地线。
We present two practical linear methods computing straightest geodesics starting from a given point and going along a special tangent direction on triangle mesh.
基于三角网生长算法和分治算法的思想，提出并实现了一个平面域散乱点的三角网格重构算法。
Based on ideas of triangulation network growth algorithm and partition algorithm, a triangular mesh reconstruction algorithm in dishevelled points of planar domain is presented and realized.
坐标转换简化为投影点与投影平面均匀三角网格之间的空间关系。
The coordinate transformation can deduce to locate a point into the evenly triangle network.
本文通过设计一个软件界面，输入三维散乱点的集合，输出为由三角网格组成的物体的表面。
This paper designs a software interface, it takes 3d scattered points as input and triangle mesh as output.
该方法对人脸特征点集做三角剖分，在纹理图像和三维网格之间建立了一个准确的拓扑同构映射关系，从而得到高真实度的纹理映射。
Applying a D-triangulation on the facial feature points, a precise and topological isomorphic mapping is established between 3d mesh and texture. The texture mapping with high quality can be obtained.
该方法对人脸特征点集做三角剖分，在纹理图像和三维网格之间建立了一个准确的拓扑同构映射关系，从而得到高真实度的纹理映射。
Applying a D-triangulation on the facial feature points, a precise and topological isomorphic mapping is established between 3d mesh and texture. The texture mapping with high quality can be obtained.
应用推荐