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.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
A heuristic strategy is presented to solve the point location problem in spherical triangulation mesh.
提出了一种适用于球面三角形网格的启发式点定位策略。
In this article the course of using computer to solve the problem of precision estimation about triangulation network is introduced.
介绍在平面三角网设计中，精度估算问题的计算机实现过程。
In this article the course of using computer to solve the problem of precision estimation about triangulation network is introduced.
介绍在平面三角网设计中，精度估算问题的计算机实现过程。
应用推荐