Polyline Simplification

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

Polyline simplification is an important process in computational geometry. The objective is to reduce the number of points of a complicated path while maintaining its basic shape. This need arises naturally in cartography, where very complicated paths frequently occur as coastlines, river basins, and other natural forms. The sample data in this Demonstration, for example, is a sequence of latitude-longitude pairs recorded by a GPS during a bike ride in western North Carolina. The algorithm implemented in this Demonstration is called the Douglas-Peucker algorithm.

Contributed by: Mark McClure (March 2011)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.