Sammanfattning 
In several application projects we have discovered the need of
computing the maximal inscribed convex set of a digital shape.
I will 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. These results by Robin Strand
and me were briefly presented at ICIAP 2005, but now I will go into some more detail.
