Convexities defined by means of distance functions

  • Gabriela Cristescu
  • Liana Lupşa
Part of the Applied Optimization book series (APOP, volume 68)


It was proved in J. M. Chassery (1983) that if a set A ⊂ Z2(h) is discrete convex (in the sense of definition 4.3.2) then there is a convex set inR2 such that A is its digitisation. In this chapter we intend to study the sets that are the solution of the converse problem: to find the properties of the sets that become, after digitisation, the same discrete convex set. The properties of convexity with respect to a set and two behaviours, studied in the previous chapter, will allow us to solve the above-mentioned problem. The methods of digitisation are not studied in this chapter. They are discussed in the thesis of M. L. P. van Lierop (1987) and further in M. Maes (1990). In chapter 10 we shall choose a particular digitisation method that leads to all the results of this chapter, but it is not unique, the results being easy to retrieve if the digitisation method is changed.


Distance Function Closed Ball Previous Chapter Convexity Property Weak Approximation 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • Gabriela Cristescu
    • 1
  • Liana Lupşa
    • 2
  1. 1.Aurel Vlaicu University of KradAradRomania
  2. 2.Babeş-Bolyai University of Cluj-NapocaCluj-NapocaRomania

Personalised recommendations