Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Convex Hull Algorithms
CHF 43.30
Auf Lager
SKU
V1Q1MAPBAN9
1 Verfügbar 
Geliefert zwischen Mi., 14.01.2026 und Do., 15.01.2026
Details
High Quality Content by WIKIPEDIA articles!In mathematics, convex metric spaces are, intuitively, metric spaces with the property any "segment" joining two points in that space has other points in it besides the endpoints.It is important to note, however, that metric convexity defined this way does not have one of the most important properties of Euclidean convex sets, that being that the intersection of two convex sets is convex. Indeed, as mentioned in the examples section, a circle, with the distance between two points measured along the shortest arc connecting them, is a (complete) convex metric space. Yet, if x and y are two points on a circle diametrally opposite to each other, there exist two metric segments connecting them (the two arcs into which these points split the circle), and those two arcs are metrically convex, but their intersection is the set {x,y} which is not metrically convex.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131215735
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131215735
- Format Fachbuch
- Titel Convex Hull Algorithms
- Herausgeber Betascript Publishing
- Anzahl Seiten 88
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
