Abstract
In the general first-level classification of the convexity properties for sets, discrete convexities appear in more classes. A second-level classification identifies more subclasses containing discrete convexity properties, which appear as approximations either of classical convexity or of fuzzy convexity. First, we prove that all these convexity concepts are defined by segmental methods. The type of segmental method involved in the construction of discrete convexity determines the subclass to which it belongs. The subclasses containing the convexity properties that have discrete particular cases are also presented.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Cristescu, G., Lupsa, L. Classes of Discrete Convexity Properties. Discrete Comput Geom 31, 461–490 (2004). https://doi.org/10.1007/s00454-003-2877-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-003-2877-x