ON CURVE MATCHING.

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

An algorithm to find the longest common subcurve of two 2-D curves is presented. It proved to be robust and efficient in practical applications. The algorithm is based on conversion of the curves into 'shape signature strings' and application of string matching techniques to find long matching substrings. Then direct curve matching is applied to the corresponding candidate subcurves to find the longest matching subcurve. The algorithm has industrial applications to problems of object assembly and object recognition. Experimental results are included.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages307-310
Number of pages4
ISBN (Print)0818607793
StatePublished - 1987
Externally publishedYes

Fingerprint

Dive into the research topics of 'ON CURVE MATCHING.'. Together they form a unique fingerprint.

Cite this