The eccentricity transform associates to each point of a shape the shortest distance to the point farthest away from it. It is defined in any dimension, for open and closed manyfolds. Top-down decomposition of the shape can be used to speed up the computation, with some partitions being better suited than others. We study basic convex shapes and their decomposition in the context of the continuous eccentricity transform. We show that these shapes can be decomposed for a more efficient computation. In particular, we provide a study regarding possible decompositions and their properties for the ellipse, the rectangle, and a class of elongated shapes. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Ion, A., Peltier, S., Haxhimusa, Y., & Kropatsch, W. G. (2007). Decomposition for efficient eccentricity transform of convex shapes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4673 LNCS, pp. 653–660). Springer Verlag. https://doi.org/10.1007/978-3-540-74272-2_81
Mendeley helps you to discover research relevant for your work.