Solving jigsaw puzzles by computer
暂无分享,去创建一个
[1] H. Freeman,et al. Apictorial Jigsaw Puzzles: The Computer Solution of a Problem in Pattern Recognition , 1964, IEEE Trans. Electron. Comput..
[2] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..
[3] Frank Harary,et al. Graph Theory , 2016 .
[4] T. C. Raymond. Heuristic algorithm for the traveling-salesman problem , 1969 .
[5] Mandell Bellmore,et al. Pathology of Traveling-Salesman Subtour-Elimination Algorithms , 1971, Oper. Res..
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Norman I. Badler,et al. Jigsaw puzzle matching using a boundary-centered polar encoding , 1982, Comput. Graph. Image Process..
[8] Eugene L. Lawler,et al. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .
[9] Edith Schonberg,et al. Two-Dimensional, Model-Based, Boundary Matching Using Footprints , 1986 .
[10] Micha Sharir,et al. Identification of Partially Obscured Objects in Two and Three Dimensions by Matching Noisy Characteristic Curves , 1987 .