Sie suchten nach: convex hull (Englisch - Griechisch)

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

convex
κυρτή καμπύλη

convex bank
κυρτή όχθη

convex surface
κυρτή επιφάνεια

convex fillet weld
ραφή σε γωνία με κυρτό κορδόνι ραφής

double-convex lens
αμφίκυρτοι φακοί

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

pebble convex lantern
Φανάρι κυρτού φακού

double-convex package
Συσκευασία διπλής σφαίρας

log convex tolerance limits
λογαριθμο-κυρτά όρια ανοχής

hindquarter thick. profiles convex
Οπίσθια τεταρτημόρια χονδρά. κυρτές πλάγιες όψεις

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

non-flat (convex) mirror measurement
Μέτρηση σε μη επίπεδα κάτοπτρα (κυρτά)

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

back extremely convex, extremely wide, extremely thick
Ράχη εξαιρετικά κυρτή, εξαιρετικά ευρεία, εξαιρετικά χονδρή

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.

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}.