d discrete points 三维散乱点
discrete points fitting 离散点拟合
sequential discrete points 离散点
unorganized discrete points 离散数据点
3 d discrete points 三维散乱点
discrete points interpolation 离散点插值
discrete points parameterization 离散点参数化
Experimental results show that the time complexity of the proposed algorithm is O(nlogn), and the algorithm is available to both small and massive amount of discrete points.
实验结果表明，该算法的时间复杂度为O(nlogn)，对于少量或海量离散点均具有较好的适应性。
参考来源 - 基于不规则三角网构建的网格生长算法·2,447,543篇论文数据，部分数据来源于NoteExpress
There they can be applied to specific, discrete points in the developing application.
在那里，可以将它们应用在正在开发中的应用程序的特定的，离散的地点。
Based on discrete points isoline generation algorithm inside, including sample data.
基于离散点的等值线生成算法，里面包括样例数据。
Using difference method, numerical solutions of stress function of the discrete points can be obtained.
利用差分法可以求出自由扭转截面内各离散点应力函数的数值解。
应用推荐