After establishing the topology relationship of scattered points, the mesh surface model of point data is reconstructed by triangulation.
建立了散乱点云数据之间的拓扑信息，对点云数据进行三角剖分重构网格曲面模型。
Based on the idea of constrained triangulation, a practical criterion and corresponding algorithm to determine the point inclusion of polygon are put forward.
基于受约束的三角划分的思想，提出了一种新的判断点在多边形内外的准则，并给出了算法。
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.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
应用推荐