Recently a new convexity measure has been proposed based on approximation of input contour with a convex polygon. In this paper, an optimal algorithm is proposed for the construction of the convex polygon. The introduced algorithm provides exact value of the convexity measure and can therefore be used for evaluation of faster heuristic algorithms.
Optimal algorithm for convexity measure calculation
2005-01-01
177281 byte
Conference paper
Electronic Resource
English
Optimal Algorithm for Convexity Measure Calculation
British Library Conference Proceedings | 2005
|British Library Online Contents | 2006
|A fast parallel image convexity algorithm
Automotive engineering | 1997
|A Fast Parallel Image Convexity Algorithm
British Library Conference Proceedings | 1997
|Convexity-Based Visual Camouflage Breaking
British Library Online Contents | 2001
|