1) the shortest distance priority
最近距离优先
2) minimum distance
最近距离
1.
Based on this observation, an offset method is presented for computing the minimum distance between two planar algebraic curves.
通过几何观察,指出一条曲线上的最近点是另一条曲线的等距曲线与该曲线的切点这一事实,同时提出基于等距思想的方法来求解2条平面代数曲线间的最近距离。
2.
The minimum distance computation problem has wide applications in CAD/CAM and computer graphics.
为了精确计算Bézier曲线/曲面间的最近距离,结合稳定的曲线、曲面分裂技术提出一种基于offset滚动球裁剪的几何算法。
3.
An effective and straightforward algorithm is developed for computation of minimum distance between two Bézier curves.
针对Bzier曲线间最近距离计算问题,提出一种简捷、可靠的计算方法。
3) closest distance
最近距离
1.
Research on the closest distance algorithms for two adjacent entities in spatial relationship;
空间关系中两相邻实体间最近距离算法研究
2.
The algorithm for finding closest distance from known point to known surface based on calculating high degrees equation set leads to big errors and a new method based on the Nelder-Meade algorithm was proposed.
针对利用高阶次曲面方程计算点到曲面的距离误差大的问题,提出了利用单纯形法进行优化,获得点到曲面的最近距离。
4) Shortest Distance First Principle
最短距离优先原则
6) nearest neighbor first
最近邻优先
1.
Moreover,a nearest neighbor first(NNF) method is proposed,whose efficiency is attested with the data KDD Cup 1999.
以基于数据挖掘方法的入侵检测技术研究为核心,对数据挖掘技术和入侵检测技术进行了研究和分析,探讨了数据挖掘方法中聚类算法在入侵检测中的应用,提出了一种基于最短距离算法的最近邻优先(NearestNeighbor First)算法,并采用KDD Cup 1999数据集中的数据对该算法的执行效率进行检测。
补充资料：最近
1.指说话前或后不久的日子。 2.极为接近。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条