Abstract
Purchase PDF (719 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (40)
Purchase PDF (437 K)
doi:10.1016/0031-3203(91)90056-B 
Copyright © 1991 Published by Elsevier Science B.V.
Polygonal shape recognition using string-matching techniques
Received 24 July 1990;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this paper we study several aspects of the use of string-matching techniques as an approach to the problem of recognizing and classifying polygons. Several authors have already proposed methods for polygon recognition that are based on string-matching. In many cases, however, linear strings are used to represent polygons, which makes it difficult to handle different orientations of an object efficiently. We can, however, easily extend the linear string-matching techniques to cyclic strings, at some small computational cost. We will propose a method to represent polygons as cyclic strings and we will show how cyclic string-matching techniques can be used for rotation-, translation- and scale-independent polygonal shape recognition. We will, however, also point out the limitations of such an approach.
Author Keywords: Pattern recognition; Automatic inspection; Polygonal shapes; String-matching; Cyclic strings
