This paper puts forward a triangulation algorithm used for space closed point-cloud.
提出了一种针对空间封闭点云的三角剖分算法。
This is to use PHP to achieve triangle localization algorithm, including the training of the triangulation algorithm.
说明：这个是用php实现的三角定位算法，其中还包括三角定位的训练算法。
In contrast with the local triangulation algorithm, the algorithm in this paper is more powerful to avoid surface self intersection.
与基于中轴的三角剖分算法相比，该文算法需要更少和更简单的计算。
A new triangulation algorithm based on Delaunay triangulation and the advantage of simplicity and rapidness of advancing front method is constructed.
基于波前推进法提出了一种针对任意平面区域生成三角形网格的全自动生成算法。
Generation of triangular meshes for digital terrain model is studied, the triangulation algorithm of discrete points and edges and its data structure are presented.
对构筑三角形网格建立数字地形模型进行了研究，给出了基于散乱点和边建立三角形网格地形模型的生成算法和数据结构。
The precision data of section contour is obtained by NURBS approximation. Based on which, the triangulation algorithm of scattered data is carried out through the disposal of NURBS compatibility.
利用NURBS曲线的拟合技术实现了截面轮廓数据的精整，在此基础上，采用曲线间相容性处理实现了散乱数据的三角剖分算法。
A fast triangulation algorithm for 3d scattered data is presented. The algorithm has almost liner complexity and can effectively solve the region with holes that common algorithm can not dispose.
提出了一种针对3d离散数据点的空间三角网格生成算法，该算法具有接近线性的复杂度，并有效地解决了一般算法不能处理的带有孔洞表面的情况。
Based on the idea of constrained triangulation, a practical criterion and corresponding algorithm to determine the point inclusion of polygon are put forward.
基于受约束的三角划分的思想，提出了一种新的判断点在多边形内外的准则，并给出了算法。
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.
本文提出了一种基于局部信息的区域扩张算法(LIBRG)，用以解决由离散点云重构三角网格面的问题。
The paper studies the main algorithm of morphing between spatial triangle meshes, which follows former articles of scatter data triangulation.
研究了在散乱数据的三角剖分后对所形成的空间三角形网格进行变形的具体操作算法。
In this paper, analyse the existed algorithms and put forward the method to make use of divide algorithm to realize plane scattered data triangulation.
文中在分析已有算法的基础上，提出利用分治算法实现平面散乱点三角剖分。
A new algorithm for the minimum weight triangulation (MWT) of points on a plane, called evolutive minimum weight triangulation (EMWT), is presented.
提出了一种解决平面点集最小权三角划分的新方法——最小权三角划分进化算法。
A video interpolation algorithm based on triangulation analysis and high-frequency compensation is proposed. And its VLSI architecture implementation is given in this.
提出一种基于三角分析和高频补偿的视频插值算法及其VLSI实现方法。
This paper discusses an algorithm of dynamic triangulation for RSG model of terrain.
论述了一种基于规则格网地形模型的动态构网算法。
This paper presents an algorithm to find homonymous line from images based on Delaunay triangulation(TIN).
提出了根据同名像点构成三角网（TIN）来进行同名直线的匹配。
This paper discusses an algorithm of real-time dynamic triangulation for RSG model of terrain.
本文论述了一种基于规则格网地形模型的实时动态构网算法。
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.
基于三角网生长算法和分治算法的思想，提出并实现了一个平面域散乱点的三角网格重构算法。
In order to fill contours fast and conveniently, a new automatic filling algorithm between contours based on triangulation irregular net was proposed.
为了快速方便地进行等值线自动填充，提出了一种基于不规则三角网的等值线自动填充算法。
Absrtact: an algorithm of dense disparity map extraction is presented based on triangulation mesh.
摘要：提出一种基于三角形网格的浓密视差图提取算法。
The existing 3D localization algorithm can be classified into two sorts:one solution is based on information exchange with anchors, and the position is calculated by methods such as triangulation.
现有的三维定位算法有两种解决方案，一种是依靠与锚节点进行信息交换，通过三角计算等方法来获取未知节点的位置；
BEM triangulation mesh generation method was mainly investigated and further proposed a mesh generation algorithm through restriction points.
重点研究了BE M中三角网格剖分方法，提出了过约束点的剖分算法。
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.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
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.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
应用推荐