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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Preparata, F.P., Shamos, M.I.: Computational Geometry an Introduction. Springer, New York (1985)
Borgefors, G.: Distance transformations in digital images. Computer Vision, Graphics, and Image Processing 34, 344–371 (1986)
Borgefors, G.: On digital distance transforms in three dimensions. Computer Vision and Image Understanding 64, 368–376 (1996)
Chassery, J.M., Coeurjolly, D.: Optimal shape and inclusion. In: Ronse, C., Najman, L., Decencière, E. (eds.) Mathematical Morphology: 40 Years On. Computational Imaging and Vision, pp. 229–248. Springer, Dordrecht (2005)
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)
Chang, J.S., Yap, C.K.: A polynomial solution for the potato-peeling problem. Discrete & Computational Geometry 1, 155–182 (1986)
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)
Borgefors, G., Sanniti di Baja, G.: Analyzing nonconvex 2D and 3D patterns. Computer Vision and Image Understanding 63, 145–157 (1996)
Piper, J., Granum, E.: Computing distance transformations in convex and non-convex domains. Pattern Recognition 20, 599–615 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borgefors, G., Strand, R. (2005). An Approximation of the Maximal Inscribed Convex Set of a Digital Object. In: Roli, F., Vitulano, S. (eds) Image Analysis and Processing – ICIAP 2005. ICIAP 2005. Lecture Notes in Computer Science, vol 3617. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553595_54
Download citation
DOI: https://doi.org/10.1007/11553595_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28869-5
Online ISBN: 978-3-540-31866-8
eBook Packages: Computer ScienceComputer Science (R0)