Usted buscó: the convex hull property (Inglés - Griego)

convex hull
Κυρτό σχήμα

convex hull corner
Γωνία κυρτού περιβλήματος

construct the convex hull of this polygon
Κατασκευή του κυρτού σχήματος αυτού του πολυγώνου

a polygon that corresponds to the convex hull of another polygon
Ένα πολύγωνο που αντιστοιχεί στο κυρτό σχήμα κάποιου άλλου πολυγώνου

the convex hull of the bézier polygon contains the bézier curve.
the κυρτό περίβλημα του πολυγώνου bézier περιέχει (εσωκλύει) την καμπύλη bézier.

the convex hull of the sixteen red-points is shaded in pink.
the convex hull of the sixteen red-points is shaded in pink.

in each set, the two points are joined by a pink line-segment, which is the convex hull of the original set.
in each set, the two points are joined by a pink line-segment, which is the convex hull of the original set.

an old result due to schur and horn states that the set of possible diagonal vectors of an hermitian matrix with given eigenvalues is the convex hull of all the permutations of the eigenvalues.
[87Ένα παλαιό αποτέλεσμα λόγω του schur και του horn δηλώνει ότι το σύνολο πιθανών διαγώνιων διανυσμάτων μιας hermitian μήτρας με δεδομένα eigenvalues είναι κυρτή όλων των μεταλλαγών eigenvalues.

the ratio of the height of the convex body to the cylindrical neck of the bottle = approximately 2.5:1;
Η σχέση ύψος του διογκωμένου τμήματος/κυλινδρικός λαιμός της φιάλης = κατά προσέγγιση 2,5: 1.

‘virtual perimeter of the tyre footprint’ means the convex polygonal curve circumscribing the smallest area containing all points of contact between the tyre and the ground;
«θεωρητική περίμετρος του ίχνους του ελαστικού», σημαίνει την κυρτή πολυγωνική καμπύλη που περιβάλλει τη μικρότερη επιφάνεια η οποία περιλαμβάνει όλα τα σημεία επαφής ελαστικού και εδάφους·

and also considered the "convex" closure of a problem of non-convex minimization—that is, the problem defined as the closed convex hull of the epigraph of the original problem.
and also considered the "convex" closure of a problem of non-convex minimization—that is, the problem defined as the closed convex hull of the epigraph of the original problem.

comparing the left array and the right pane, one confirms that the right-hand plus-symbol is indeed the sum of the four plus-symbols from the left-hand sets, precisely two points from the original non-convex summand-sets and two points from the convex hulls of the remaining summand-sets.__the shapley–folkman lemma is illustrated by the minkowski addition of four sets.
comparing the left array and the right pane, one confirms that the right-hand plus-symbol is indeed the sum of the four plus-symbols from the left-hand sets, precisely two points from the original non-convex summand-sets and two points from the convex hulls of the remaining summand-sets._: {0, 1} + {0, 1} = {0 + 0, 0 + 1, 1 + 0, 1 + 1} = {0, 1, 2}.