Ramer-Douglas-Peucker Algorithm (Paperback)


High Quality Content by WIKIPEDIA articles! 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.

R934

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles9340
Mobicred@R88pm x 12* Mobicred Info
Free Delivery
Delivery AdviceOut of stock

Toggle WishListAdd to wish list
Review this Item

Product Description

High Quality Content by WIKIPEDIA articles! 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.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Betascript Publishing

Country of origin

Germany

Release date

October 2010

Availability

Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.

First published

October 2010

Editors

, ,

Dimensions

152 x 229 x 5mm (L x W x T)

Format

Paperback - Trade

Pages

84

ISBN-13

978-6132931085

Barcode

9786132931085

Categories

LSN

6132931082



Trending On Loot