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.
Ramer Douglas Peucker Algorithm
CHF 37.30
Auf Lager
SKU
5FF8NDVDT17
1 Verfügbar 
Geliefert zwischen Mi., 26.11.2025 und Do., 27.11.2025
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The Douglas Peucker algorithm is an algorithm for reducing the number of points in a curve that is approximated by a series of points. The initial form of the algorithm was independently suggested in 1972 by Urs Ramer and 1973 by David Douglas and Thomas Peucker. (See the References for more details.) This algorithm is also known under the following names: the Ramer Douglas Peucker algorithm, the iterative end-point fit algorithm or the split-and-merge algorithm.The purpose of the algorithm is, given a ''curve'' composed of line segments, to find a similar curve with fewer points. The algorithm defines ''dissimilar'' based on the maximum distance between the original curve and the simplified curve. The simplified curve consists of a subset of the points that defined the original curve.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131365423
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H220mm x B220mm
- EAN 9786131365423
- Titel Ramer Douglas Peucker Algorithm
- Herausgeber Betascript Publishing
- Anzahl Seiten 68
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
