An approximation of the maximal inscribed convex set of a digital object

Abstract

In several application projects we have discovered the need of computing the maximal inscribed convex set of a digital shape, Here we present an algorithm for computing a reasonable approximation of this set, that can be used in both 2D and 3D. The main idea is to iteratively identify the deepest concavity and then remove it by cutting off as little as possible of the shape. We show results using both synthetic and real examples. © Springer-Verlag Berlin Heidelberg 2005.