This paper will introduces 3d measurement and cutting algorithm detailed in third and fourth chapter.
本文将分别在第三章和第四章详细介绍三维测量和剖切算法。
Constrained two-dimensional stock cutting algorithm based on heuristic regulation is given in this paper.
本文提出了基于启发式规则的有限制二维板材下料算法。
In addition, image automatic cutting algorithm and a method to obtain the width of character stroke are proposed.
另外，本文还提出了计算文字笔画宽度的方法和图形的自动切割算法。
Therefore, it is necessary to study new soft-tissue cutting algorithm, which belongs to element subdivision algorithm.
因此有必要研究一种新的基于体元剖分的软组织切割算法。
This paper used the linear assembly language to re-design program structure and realized the optimization of reading reference samples, filter processing and transfer of cutting algorithm.
用线性汇编语言重新设计程序结构优化循环语句，实现读取参考样本、滤波处理和移位裁剪算法的优化，避免重复读取同一个参考样本的情况。
Experiment results show that this algorithm has better robustness in JPEG compression, random noising attacks, cutting and noise adding.
实验结果表明该算法对JPEG压缩、随机噪声攻击、剪切及加噪等具有较高的鲁棒性。
Two-dimensional stock cutting problem can be settled by solving two one-dimensional knapsack problems, this paper presents a new algorithm based on the ant colony optimization idea.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
This paper proposes a bitmap vectorization technique based on a thinning algorithm, which makes the layout automation and wire-cutting machine applicable to the shoes manufacturing.
介绍了基于细化算法的位图矢量化技术，使得自动排料与线切割系统能够运用于制鞋工业。
Based on hardware-accelerated texture-based volume rendering algorithm, this paper proposed two methods for volume cutting, which are based on either depth buffer or discrete distance field.
在硬件纹理加速体重建算法的基础上，提出了两种模拟三维数据切割的方法：利用深度缓存实现和利用离散距离场实现。
On the basis of researching network partitioning method based on branch cutting, a new algorithm which implements network partitioning by means of cutting branches is proposed.
在研究基于支路切割的网络分块方法的基础上，提出了一种通过切割支路实现网络分块的新算法。
On the basis of researching network partitioning method based on branch cutting, an algorithm which implements network partitioning by means of cutting branches is proposed.
在研究基于支路切割的网络分块方法基础上，提出了一种通过切割支路将网络分块的算法。
An algorithm for open cutting was presented for mesh adaptive technique, and the template library based on mesh adaptive was built.
针对板料成形模拟过程中的工艺切口问题，提出了网格自适应加密与减密技术的工艺切口算法。
Through the modification of the algorithm, the precision of cutting paper and follow of cutting speed was approved.
通过对算法的进一步改进，提高了切纸精度，实现了好的剪切速度跟随。
This paper presents an algorithm for the fast cutting of feedback lines in a digital circuit.
本文提出了一种数字电路反馈线的快速切割算法。
Adopt new micro-step algorithm to ensure high-quality cutting with high and smoother curves.
采用新的微步细分算法，使高速切割时同样具有高的切割品质，曲线更加圆滑。
On the basis of the existing algorithm of cutting polygon, the cutting method is developed of complicacy polygon including arc.
本文在已有多边形裁剪算法的研究基础之上，提出了包含圆弧段的复杂多边型裁剪方法。
As for the one-dimensional cutting problem, the paper comes up with a model of mutual deadline, in allusion to which, a new algorithm is put forward, that is, DP greedy algorithm.
对于一维下料问题，本文得到一个有各自交货时间的模型。针对该模型提出一种新的算法：DP贪婪算法。
Then by cutting boundary technique, algorithm of points placement can be realize in arbitrary areas.
然后利用切边处理技术，实现任意区域内的布点算法。
Experimental results show the algorithm has a good effect of hiding, anti-cutting and anti-compressing.
实验表明，算法还具有较好的隐藏效果和很好的抗剪切、抗压缩等功能。
The algorithm can be used to control the orientation of the cutter so as to avoid over-cutting in surface machining.
该算法可用于曲面加工过程中的刀具姿态控制，以避免曲面的过切现象。
In this paper, based on continued fractions algorithm and branching-bounding algorithm, a new algorithm applied in cutting a long rectangular sheet into several sections is put forward.
本文结合连分数算法，采用分支定界原理提出了一种新的板材分割算法。
Experimental results show that the algorithm has a good performance of hiding, anti-cutting and erasing and anti-compressing.
实验表明，该算法具有较好的隐藏效果，并能很好地抵抗剪切、擦除、压缩等攻击且健壮性强。
While designing the algorithm, we have considered the situation at large. Thus, the algorithm is feasible in solving most of the actual stock cutting problems especially in large scale.
算法设计时考虑了普遍的情况，所以算法在解决大多数实际下料问题，特别是大规模下料问题时是切实有效的。
The paper based on the idea of K-OPT Algorithm for TSP, present a swap algorithm for the one-dimensional cutting-stock problem.
根据旅行商问题（TSP）的邻域搜索算法的思想，提出了型材下料问题的一种优化算法。
To resolve the rectangular cutting stock problem, this paper proposes a new greedy algorithm, based on analyzing the main disadvantage of the traditional approximate algorithm.
针对矩形件排样优化问题，分析了传统近似算法的主要缺陷，在此基础上，提出一种新的排样算法——贪婪算法。
The theory and algorithm of BP neural network were introduced, and it was used in the fault trend prediction for cutting part transmission system of mining machine.
介绍了BP网络的原理、算法，并用BP网络对采煤机截割部齿轮箱机械传动系统的故障进行了趋势预测。
The simulation results verify that the algorithm is efficient in cutting the redundancy data and reducing transmission delay.
实验模拟结果也表明算法有效地减少了冗余数据和传输延时。
The simulation results verify that the algorithm is efficient in cutting the redundancy data and reducing transmission delay.
实验模拟结果也表明算法有效地减少了冗余数据和传输延时。
应用推荐