An Efficiently Computable Metric for Comparing Polygonal Shapes

  • Authors:
  • Esther M. Arkin;L. Paul Chew;Daniel P. Huttenlocher;Klara Kedem;Joseph S. B. Mitchell

  • Affiliations:
  • -;-;-;-;-

  • Venue:
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Year:
  • 1991

Quantified Score

Hi-index 0.15

Visualization

Abstract

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.