Computing the eccentricity transform of a polygonal shape

Abstract

The eccentricity transform associates to each point of a shape the distance to the point farthest away from it. The transform is defined in any dimension, for open and closed manyfolds, is robust to Salt & Pepper noise, and is quasi-invariant to articulated motion. This paper presents and algorithm to efficiently compute the eccentricity transform of a polygonal shape with or without holes. In particular, based on existing and new properties, we provide an algorithm to decompose a polygon using parallel steps, and use the result to derive the eccentricity value of any point. © Springer-Verlag Berlin Heidelberg 2007.