Visvalingam–Whyatt algorithm: Difference between revisions

Revision as of 13:08, 31 May 2024

Latest revision as of 13:42, 31 May 2024

(3 intermediate revisions by the same user not shown)

Line 1:

{{Short description|Curve simplification algorithm}}
[[File:Douglas–Peucker and Visvalingam–Whyatt simplification algorithms.svg|thumb|upright=1.3|Comparison with [[Douglas–Peucker algorithm]]]]

The '''Visvalingam–Whyatt algorithm''', alsoor known assimply the '''Visvalingam's algorithm''', is an algorithm that [[Decimation (signal processing)|decimates]] a curve composed of line segments to a similar curve with fewer points, primarily for usage in [[cartographic generalisation]].

== Idea ==

Given a [[polygonal chain]] (often called a Polylinepolyline), the algorithm attempts to find a similar chain composed of fewer points.

Points are assigned an importance based on local conditions, and points are removed from the least important to most important.

Line 41 ⟶ 42:

== References ==

;Notes

<!-- Inline citations added to your article will automatically display here. See en.wikipedia.org/wiki/WP:REFB for instructions on how to add citations. -->

{{reflist}}

;Bibliography

* {{Cite journal |last=Visvalingam |first=M. |last2=Whyatt |first2=J. D. |year=1993 |title=Line generalisation by repeated elimination of points |url=https://hull-repository.worktribe.com/preview/376364/000870493786962263.pdf |journal=The Cartographic Journal |language=en |volume=30 |issue=1 |pages=46–51 |doi=10.1179/000870493786962263 |issn=0008-7041}}

== External links ==

* [https://www.jasondavies.com/simplify/ Interactive example of the algorithm]

* [https://hull-repository.worktribe.com/output/459275 1992 Paper proposing the method.]

{{DEFAULTSORT:Visvalingam-Whyatt algorithm}}