Fast Fragment Assemblage Using Boundary Line and Surface Matching

5Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the recent past, fragment matching has been treated in two different approaches, one using curve matching methods and one that compares whole surfaces or volumes, depending on the nature of the broken artefacts. Presented here is a fast, unified method that combines curve matching techniques with a surface matching algorithm to estimate the positioning and respective matching error for the joining of three-dimensional fragmented objects. Combining both aspects of fragment matching, essentially eliminates most of the ambiguities present in each one of the matching problem categories and helps provide more accurate results with low computational cost.

Cite

CITATION STYLE

APA

Papaioannou, G., & Theoharis, T. (2003). Fast Fragment Assemblage Using Boundary Line and Surface Matching. In IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (Vol. 1, pp. 2–7). IEEE Computer Society. https://doi.org/10.1109/CVPRW.2003.10012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free