| 摘要: |
| 针对通过纵向切割、纵横交错切割等方法得到的碎纸片模型进行拼接复原，以碎片图形边缘像素点的匹配程度为判断依据，提出一种有效的算法，很好地解决了纵横切割所得到的规则碎片模型的拼接问题；在误差调整方面，提出了以计算机辅助人工进行较正取代单纯的人工较正，并给出了辅助算法；对非纵横切所得规则图片的拼接也从理论上提出了相应的算法。 |
| 关键词: 匹配率 碎片行分组 行匹配率 贪心法 |
| DOI： |
| 分类号: |
| 基金项目: |
|
| An Algorithm for Regular Fragments Reassembling |
|
LI Meng1, LIU Jia bao2
|
| Abstract: |
| Only aiming at the paper fragment models based on the longitudinal cut method or the crisscrossed cut method, according to the matching degree of the pixels on the edge of the graphics, this paper proposed an efficient fragments reassembling algorithm, which solves the problem of regular fragments reassembling by crisscrossed cut. In the aspect of error regulation, a way of using the computer aid manual work instead of the only manual adjustment and the auxiliary algorithm are proposed. Meanwhile, the corresponding algorithm for the regular fragments reassembling resulting from non crisscrossed cut is theoretically put forward as well. |
| Key words: matching rate group dividing of fragment lines the matching rate of lines Greedy Method |
