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 computeraid 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 noncrisscrossed cut is theoretically put forward as well.
参考文献
相似文献
引证文献
引用本文
李猛, 刘家保.规则碎片拼接算法[J].重庆工商大学学报(自然科学版),2015,32(8):43-48 LI Meng, LIU Jiabao. An Algorithm for Regular Fragments Reassembling[J]. Journal of Chongqing Technology and Business University(Natural Science Edition),2015,32(8):43-48