Loading...
Please wait, while we are loading the content...
Similar Documents
Partial Mat hing of Planar Polygons Under Translation and Rotation
| Content Provider | Semantic Scholar |
|---|---|
| Author | Creath, Eri C. M. |
| Copyright Year | 2008 |
| Abstract | Curve mat hing is an important omputational task for domains su h as: re onstru tion of ar haeologi al fragments, forensi s investigation, measuring melodi similarity, and model-based obje t re ognition. There are a variety of measures and algorithmi approa hes used to address the urve mat hing problem in luding: shape signature strings with substring mat hing, geometri hashing, and Hausdor distan e approa hes. In this paper we propose an approa h that uses a turning fun tion representation of the shape and also uses a L2 measure for omparing mat hes. The novel algorithm presented nds the best mat h along a xed length portion of two polygon's perimeters where the polygons may be arbitrarily translated and rotated. The algorithm's time omplexity is O(mn(n + m)) where n and m are the numbers of verti es in the perimeters being mat hed. The utility of the algorithm is demonstrated in the reonstru tion of a small jigsaw puzzle. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://users.cecs.anu.edu.au/~Eric.McCreath/papers/cccg08mccreath.pdf |
| Alternate Webpage(s) | http://cs.anu.edu.au/people/Eric.McCreath/papers/cccg08mccreath.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
