Sciweavers

Share
CAIP
2007
Springer

Decomposition for Efficient Eccentricity Transform of Convex Shapes

9 years 6 months ago
Decomposition for Efficient Eccentricity Transform of Convex Shapes
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.
Adrian Ion, Samuel Peltier, Yll Haxhimusa, Walter
Added 12 Aug 2010
Updated 12 Aug 2010
Type Conference
Year 2007
Where CAIP
Authors Adrian Ion, Samuel Peltier, Yll Haxhimusa, Walter G. Kropatsch
Comments (0)
books