该方法通过在遥感图像上选取局部极值点来构成平面散乱数据点集，并在此基础上进行三角剖分、优化和三角插值曲面构造。
It gets the plane scattered data points through selecting the local extremum points on the remote image, and then triangulates, constructs the triangular interpolating surface on it.
文中在分析已有算法的基础上，提出利用分治算法实现平面散乱点三角剖分。
In this paper, analyse the existed algorithms and put forward the method to make use of divide algorithm to realize plane scattered data triangulation.
概述了平面多边形三角形剖分的各种算法，提出了一种不考虑多边形的凸凹性、顶点顺时针或逆时针走向循环消除顶点的平面多边形三角剖分算法，并给出了实例。
We have proposed an arithmetic of this kind to eliminate the vertex in a circling way, ignoring the knaggy character and the deasil or anticlockwise direction of the plane polygon.
文中还定义了平面单连通多边形区域的所谓分层三角剖分，并确定了此剖分下二次样条空间的维数。
Then, a new kind of so-called stratified triangulation of a simply connected planar polygonal region is introduced.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
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 Algorithm of Finding Pair of Three-Dimensional Points with the Minimum Distance by Means of Divide and Conquer;
文中在分析已有算法的基础上，提出利用分治算法实现平面散乱点三角剖分。
The Algorithm of Finding Pair of Three-Dimensional Points with the Minimum Distance by Means of Divide and Conquer;
应用推荐