Matching 2D Fragments of Objects

This paper describes an algorithm that pieces together 2D fragments of an object. Matching fragments of an object is useful for solving puzzles or reassembling archaeological fragments. Many factors, such as the number of pieces and the complex shapes of pieces make this a difficult problem. Various approaches to this problem exist. This paper presents an approach on corner detection and curve matching. The work described in this paper starts with 2D objects, but should be easy to extend to 3D problems.

• Type: Conference
• Year: 2008
• Where: CAINE
• Authors: Catherine Stringfellow, Richard Simpson, H. Bui, YuChun Peng, Jeffrey B. Hood
• Keywords: 2D Fragments, Archaeological Fragments, CAINE 2008, Computer Science, Paper