The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1991 vol.13)
pp: 209-216
ABSTRACT
<p>A method for comparing polygons that is a metric, invariant under translation, rotation, and change of scale, reasonably easy to compute, and intuitive is presented. The method is based on the L/sub 2/ distance between the turning functions of the two polygons. It works for both convex and nonconvex polygons and runs in time O(mn log mn), where m is the number of vertices in one polygon and n is the number of vertices in the other. Some examples showing that the method produces answers that are intuitively reasonable are presented.</p>
INDEX TERMS
computer vision; computational geometry; polygonal shapes; L/sub 2/ distance; turning functions; convex; nonconvex; computational geometry; computer vision
CITATION
E.M. Arkin, L.P. Chew, D.P. Huttenlocher, K. Kedem, J.S.B. Mitchell, "An Efficiently Computable Metric for Comparing Polygonal Shapes", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.13, no. 3, pp. 209-216, March 1991, doi:10.1109/34.75509
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool