9786131365423 - ramer-douglas-peucker algorithm: algorithm, recursion, vector graphics, cartographic generalization, alpha compositing (4 resultados)
- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 29,00
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: 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 appro…ximated 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.
- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 31,21
Envío por EUR 60,60Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: 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 approximat…ed 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.
- Tapa blanda
- Impresión bajo demanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 94,40
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: 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, 4…9078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 116,00
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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.
