Algorithms that reduce the number of points in a line or build a smooth curve from a few control points. The Ramer-Douglas-Peucker and Visvalingam-Whyatt algorithms thin out a polyline while keeping its shape, which is how map lines are simplified at small scales, and Chaikin's corner-cutting method and De Casteljau's algorithm for Bezier curves generate smooth curves from a handful of points in drawing and design software.
Browse By
Curve Simplification and Smoothing Algorithms
Filter Results2 entries
Sources
Ramer-Douglas-Peucker algorithm (Wikipedia)
Has Member: Ramer-Douglas-Peucker Algorithm, LeadQuote, Has Member: Ramer-Douglas-Peucker Algorithm, Lead
The Ramer-Douglas-Peucker algorithm, also known as the Douglas-Peucker algorithm and iterative end-point fit algorithm, is an algorithm that decimates a curve composed of line segments to a similar curve with fewer points.
Visvalingam-Whyatt algorithm (Wikipedia)
Has Member: Visvalingam-Whyatt Algorithm, LeadQuote, Has Member: Visvalingam-Whyatt Algorithm, Lead
The Visvalingam-Whyatt algorithm, or simply the Visvalingam algorithm, is an algorithm that decimates a curve composed of line segments to a similar curve with fewer points, primarily for usage in cartographic generalisation.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.