An Approximation of the Maximal Inscribed Convex Set of a Digital Object
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.
KeywordsConvex Hull Local Operation Large Neighbourhood Object Element Distance Transformation
- 1.Preparata, F.P., Shamos, M.I.: Computational Geometry an Introduction. Springer, New York (1985)Google Scholar
- 5.Chassery, J.M.: Discrete and computational geometry approaches applied to a problem of figure approximation. In: Pietikäinen, M., Röning, J. (eds.) Proc. 6th Scandinavian Conference on Image Analysis, Oulo, Finland, pp. 856–859 (1989)Google Scholar
- 7.Sintorn, I.M.: Segmentations methods and shape descriptions in digital images – applications in 2D and 3D microscopy. PhD thesis, Swedish University of Agricultural Sciences (2005)Google Scholar