Articoli correlati a Ramer-Douglas-Peucker Algorithm: Algorithm, Recursion,...
Ramer-Douglas-Peucker Algorithm: Algorithm, Recursion, Vector Graphics, Cartographic Generalization, Alpha Compositing - Brossura
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Ramer-Douglas-Peucker Algorithm: Algorithm, Recursion,...
Immagini fornite dal venditore
Ramer-Douglas-Peucker Algorithm
Print on DemandDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 68 pp. Englisch. Codice articolo 9786131365423
Compra nuovo
EUR 29,00
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Ramer-Douglas-Peucker Algorithm : Algorithm, Recursion, Vector Graphics, Cartographic Generalization, Alpha Compositing
Print on DemandDa: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Codice articolo 9786131365423
Compra nuovo
EUR 31,21
Spedizione EUR 60,60
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Ramer-Douglas-Peucker Algorithm | Algorithm, Recursion, Vector Graphics, Cartographic Generalization, Alpha Compositing
Print on DemandDa: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Ramer-Douglas-Peucker Algorithm | Algorithm, Recursion, Vector Graphics, Cartographic Generalization, Alpha Compositing | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131365423 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Codice articolo 113298556
Compra nuovo
EUR 94,40
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili
Immagini fornite dal venditore
Ramer-Douglas-Peucker Algorithm
Print on DemandDa: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. TheDouglas-Peucker algorithm is an algorithm for reducing the number ofpoints in a curve that is approximated by a series of points. Theinitial form of the algorithm was independently suggested in 1972 by UrsRamer and 1973 by David Douglas and Thomas Peucker. (See the Referencesfor more details.) This algorithm is also known under the followingnames: the Ramer-Douglas-Peucker algorithm, the iterative end-point fitalgorithm or the split-and-merge algorithm.The purpose of the algorithmis, given a 'curve' composed of line segments, to find a similar curvewith fewer points. The algorithm defines 'dissimilar' based on themaximum distance between the original curve and the simplified curve.The simplified curve consists of a subset of the points that defined theoriginal curve.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 68 pp. Englisch. Codice articolo 9786131365423
Compra nuovo
EUR 116,00
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili