Abstract
The notion convexity has a long history in mathematics. It is a useful concept to describe shapes, functions, smoothness of curves or boundaries, and it has applications in many fields. Researchers apply different definitions for digital convexity to adapt known concepts from the continuous space, and to make use of proven theories and results. We review different approaches and we propose cavity trees for (a) analyzing the convexity of digital objects, (b) to decompose those objects into meaningful parts, and (c) to show an easy way to find convex and concave parts of a boundary of a digital region.
Chapter PDF
Similar content being viewed by others
Keywords
References
Brlek, S., Lachaud, J.-O., Provençal, X.: Combinatorial view of digital convexity. In: Coeurjolly, D., Sivignon, I., Tougne, L., Dupont, F. (eds.) DGCI 2008. LNCS, vol. 4992, pp. 57–68. Springer, Heidelberg (2008)
Debled-Rennesson, I., Remy, J.-L., Rouyer-Degli, J.: Detection of discrete convexity of polyominoes. Discrete Applied Mathematics 125, 115–133 (2003)
Doerksen-Reiter, H., Debled-Rennesson, I.: Convex and concave parts of digital curves. Computational Imaging and Vision 31, 145–160 (2006)
Eckhardt, U., Doerksen-Reiter, H.: Polygonal representations of digital sets. Algorithmica 38(1), 5–23 (2004)
Kiselman, C.O.: Characterizing digital straightness and digital convexity by means of difference operators. Mathematika 57, 355–380 (2011)
Klette, R., Zunic, J.: Multigrid convergence of calculated features in image analysis. J. Mathematical Imaging Vision 13, 173–191 (2000)
Klette, R., Rosenfeld, A.: Digital Geometry – Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)
Klette, G.: Recursive calculation of relative convex hulls. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds.) DGCI 2011. LNCS, vol. 6607, pp. 260–271. Springer, Heidelberg (2011)
Klette, G.: Recursive Computation of Minimum-Length Polygons. Computer Vision and Image Understanding 117, 386–392 (2012)
Kim, C.E.: Digital convexity, straightness, and convex polygons. PAMI 4, 618–626 (1982)
Kim, C.E., Rosenfeld, A.: Digital straight lines and convexity of digital regions. PAMI 4, 149–153 (1982)
Lachaud, J.O., Vialard, A., de Vieilleville, F.: Fast, accurate and convergent tangent estimation on digital contours. Image and Vision Computing 25, 1572–1587 (2007)
Li, F., Klette, R.: Euclidean Shortest Paths. Springer, London (2011)
Melkman, A.: On-line construction of the convex hull of a simple polygon. Information Processing Letters 25, 11–12 (1987)
Minsky, M., Papert, S.: Perceptrons. MIT Press, Reading (1969)
Provençal, X., Lachaud, J.-O.: Two linear-time algorithms for computing the minimum length polygon of a digital contour. In: Brlek, S., Reutenauer, C., Provençal, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 104–117. Springer, Heidelberg (2009)
Papadopoulus, A.: Metric Spaces, Convexity and Nonpositive Curvature. European Mathematical Society (2005)
Roussillon, T., Tougne, L., Sivignon, I.: What does digital straightness tell about digital convexity? In: Wiederhold, P., Barneva, R.P. (eds.) IWCIA 2009. LNCS, vol. 5852, pp. 43–55. Springer, Heidelberg (2009)
Roussillon, T., Sivignon, I.: Reversible polygon that faithfully represents the convex and concave parts of a digital curve. Pattern Recognition 44, 2693–2700 (2011)
Rosenfeld, A.: Picture Processing by Computer. Academic Press, New York (1969)
Sklansky, J.: Recognition of convex blobs. Pattern Recognition 2, 3–10 (1970)
Sklansky, J.: Measuring cavity on a rectangular mosaic. IEEE Trans. Computing 21, 1355–1364 (1972)
Sloboda, F., Stoer, J.: On piecewise linear approximation of planar Jordan curves. J. Computational and Applied Mathematics 55, 369–383 (1994)
Sloboda, F., Zatko, B., Stoer, J.: On approximation of planar one dimensional continua. In: Klette, R., Rosenfeld, A., Sloboda, F. (eds.) Advances in Digital and Computational Geometry, pp. 113–160 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klette, G. (2014). Digital Convexity and Cavity Trees. In: Huang, F., Sugimoto, A. (eds) Image and Video Technology – PSIVT 2013 Workshops. PSIVT 2013. Lecture Notes in Computer Science, vol 8334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53926-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-53926-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53925-1
Online ISBN: 978-3-642-53926-8
eBook Packages: Computer ScienceComputer Science (R0)