如果可以这么做，那么分治算法是个好的选择。
If this can be done, then the divide-and-conquer algorithm is a good choice.
分治算法是解决许多实际问题的重要而有效的方法。
The divide and conquer algorithm is an important and efficient method to many problems.
文中在分析已有算法的基础上，提出利用分治算法实现平面散乱点三角剖分。
In this paper, analyse the existed algorithms and put forward the method to make use of divide algorithm to realize plane scattered data triangulation.
文中在分析已有算法的基础上，提出利用分治算法实现平面散乱点三角剖分。
The Algorithm of Finding Pair of Three-Dimensional Points with the Minimum Distance by Means of Divide and Conquer;
基于三角网生长算法和分治算法的思想，提出并实现了一个平面域散乱点的三角网格重构算法。
Based on ideas of triangulation network growth algorithm and partition algorithm, a triangular mesh reconstruction algorithm in dishevelled points of planar domain is presented and realized.
分治是一种递归算法，就是指利用一种方式把问题一分为二，然后用同样的方法把已分开的问题再一分为二，直到满足最小的解决单元。
Divide-and-conquer is a recursive technique, meaning that it uses some method to split a problem in half, then uses the same method to split those halves in half, and so on.
介绍了算法设计技术分治法的应用。
将内部缓冲技术、浮洞技术与分治技术相结合，提出了一种快速线性原地二路归并算法。
By combining the internal buffering technique and the float hole technique with the divide-and-conquer technique, a fast linear-time in-place 2-way merge algorithm is introduced in the paper.
将内部缓冲技术、浮洞技术与分治技术相结合，提出了一种快速线性原地二路归并算法。
By combining the internal buffering technique and the float hole technique with the divide-and-conquer technique, a fast linear-time in-place 2-way merge algorithm is introduced in the paper.
应用推荐