Computational geometry: an introduction
Computational geometry: an introduction
Computing deviations from convexity in polygons
Pattern Recognition Letters
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Similarity and Symmetry Measures for Convex Shapes Using Minkowski Addition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
A New Convexity Measure for Polygons
IEEE Transactions on Pattern Analysis and Machine Intelligence
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Hi-index | 0.00 |
We propose several measures to evaluate to which extent the shape of a given convex polygon is close to be regular, focusing on a range of characteristics of regularity: optimal ratio area-perimeter, equality of angles and edge lengths, regular fitting, angular and areal symmetry. We prove that our measures satisfy a number of reasonable requirements that guarantee them to be well defined, and provide efficient algorithms for their computation. All these algorithms have been implemented, and we provide experimental results on all the proposed measures.