Based on the idea of constrained triangulation, a practical criterion and corresponding algorithm to determine the point inclusion of polygon are put forward.
基于受约束的三角划分的思想，提出了一种新的判断点在多边形内外的准则，并给出了算法。
A heuristic strategy is presented to solve the point location problem in spherical triangulation mesh.
提出了一种适用于球面三角形网格的启发式点定位策略。
This paper puts forward a triangulation algorithm used for space closed point-cloud.
提出了一种针对空间封闭点云的三角剖分算法。
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.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
应用推荐