Abstract
Full convexity has been recently proposed as an alternative definition of digital convexity. In contrast to classical definitions, fully convex sets are always connected and even simply connected whatever the dimension, while remaining digitally convex in the usual sense. Several characterizations were proposed in former works, either based on lattice intersection enumeration with several convex hulls, or using the idempotence of an envelope operator. We continue these efforts by studying simple properties of real convex sets whose digital counterparts remain largely misunderstood. First we study if we can define full convexity through variants of the usual continuous convexity via segments inclusion, i.e. “for all pair of points of X, the straight segment joining them must lie within the set X”. We show an equivalence of full convexity with this segment convexity in dimension 2, and counterexamples starting from dimension 3. If we consider now d-simplices instead of a segment (2-simplex), we achieve an equivalence in arbitrary dimension d. Secondly, we exhibit another characterization of full convexity, which is recursive with respect to the dimension and uses simple axis projections. This latter characterization leads to two immediate applications: a proof that digital balls are indeed fully convex, and a natural progressive measure of full convexity for arbitrary digital sets.
This work was partly funded by StableProxies ANR-22-CE46-0006 research grant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Eckhardt, U.: Digital lines and digital convexity. In: Bertrand, G., Imiya, A., Klette, R. (eds.) Digital and Image Geometry. LNCS, vol. 2243, pp. 209–228. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45576-0_13
Feschet, F., Lachaud, J.O.: Full convexity for polyhedral models in digital spaces. In: Baudrier, E., Naegel, B., Krahenbuhl, A., Tajine, M. (eds.) Discrete Geometry and Mathematical Morphology. DGMM 2022. LNCS, vol. 13493, pp. 98–109. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-19897-7_9
Feschet, F., Lachaud, J.O.: An envelope operator for full convexity to define polyhedral models in digital spaces. J. Math. Imaging Vis. 65(5), 754–769 (2023). https://doi.org/10.1007/s10851-023-01155-w
Kim, C.E., Rosenfeld, A.: Convex digital solids. IEEE Trans. Pattern Anal. Mach. Intell. 6, 612–618 (1982)
Kim, C.E., Rosenfeld, A.: Digital straight lines and convexity of digital regions. IEEE Trans. Pattern Anal. Mach. Intell. 2, 149–153 (1982)
Kiselman, C.O.: Convex functions on discrete sets. In: Klette, R., Žunić, J. (eds.) IWCIA 2004. LNCS, vol. 3322, pp. 443–457. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30503-3_32
Kiselman, C.O.: Elements of digital geometry, mathematical morphology, and discrete optimization. World Scientific (2022). https://doi.org/10.1142/12584
Lachaud, J.-O.: An alternative definition for digital convexity. In: Lindblad, J., Malmberg, F., Sladoje, N. (eds.) DGMM 2021. LNCS, vol. 12708, pp. 269–282. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-76657-3_19
Lachaud, J.O.: An alternative definition for digital convexity. J. Math. Imaging Vis. 64(7), 718–735 (2022). https://doi.org/10.1007/s10851-022-01076-0
Minsky, M., Papert, S.A.: Perceptrons: An Introduction to Computational Geometry. MIT Press, Cambridge (1969)
Ronse, C.: A bibliography on digital and computational convexity (1961–1988). IEEE Trans. Pattern Anal. Mach. Intell. 11(2), 181–190 (1989)
Webster, J.: Cell complexes and digital convexity. In: Bertrand, G., Imiya, A., Klette, R. (eds.) Digital and Image Geometry. LNCS, vol. 2243, pp. 272–282. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45576-0_16
Zunić, J., Hirota, K., Rosin, P.L.: A Hu moment invariant as a shape circularity measure. Pattern Recognit. 43(1), 47–57 (2010). https://doi.org/10.1016/j.patcog.2009.06.017
Zunić, J., Rosin, P., Ilić, V.: Disconnectedness: a new moment invariant for multi-component shapes. Pattern Recognit. 78, 91–102 (2018). https://doi.org/10.1016/j.patcog.2018.01.010
Zunić, J., Rosin, P.L.: A new convexity measure for polygons. IEEE Trans. Pattern Anal. Mach. Intell. 26(7), 923–934 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Feschet, F., Lachaud, JO. (2024). New Characterizations of Full Convexity. In: Brunetti, S., Frosini, A., Rinaldi, S. (eds) Discrete Geometry and Mathematical Morphology. DGMM 2024. Lecture Notes in Computer Science, vol 14605. Springer, Cham. https://doi.org/10.1007/978-3-031-57793-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-57793-2_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-57792-5
Online ISBN: 978-3-031-57793-2
eBook Packages: Computer ScienceComputer Science (R0)
