By Topic

Efficient computation of a reflection symmetry measure for convex polygons based on Minkowski addition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tuzikov, A.V. ; CWI, Amsterdam, Netherlands ; Margolin, G.L. ; Heijmans, H.J.A.M.

This paper introduces a reflection symmetry measure for convex polygons based on Minkowski addition. An interesting property of this measure is that it can be computed in O(k3) time, where k is the number of edges of the polygon. The proposed algorithm as well as the symmetry measure computation uses the perimetric measure representation of convex polygons

Published in:

Pattern Recognition, 1996., Proceedings of the 13th International Conference on  (Volume:2 )

Date of Conference:

25-29 Aug 1996