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.
Kirkpatrick Seidel Algorithm
CHF 146.75
Auf Lager
SKU
8TALKSN164G
1 Verfügbar 
Geliefert zwischen Do., 30.04.2026 und Fr., 01.05.2026
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The Kirkpatrick Seidel algorithm, called by its authors "the ultimate planar convex hull algorithm" is an algorithm for computing the convex hull of a set of points in the plane, with O(n log h) time complexity, where n is the number of input points and h is the number of points in the hull. Thus, the algorithm is output-sensitive: its running time depends on both the input size and the output size. Another output-sensitive algorithm, the gift wrapping algorithm, was known much earlier, but the Kirkpatrick Seidel algorithm has an asymptotic running time that is significantly smaller and that always improves on the O(n log n) bounds of non-output-sensitive algorithms. The Kirkpatrick Seidel algorithm is named after its inventors, David G. Kirkpatrick and Raimund Seidel.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131219290
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Größe H220mm x B220mm
- EAN 9786131219290
- Format Fachbuch
- Titel Kirkpatrick Seidel Algorithm
- Herausgeber Betascript Publishing
- Anzahl Seiten 96
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
