Skip to content

Visualization of the Ramer Douglas Peucker algorithm, an iterative end-point fit algorithm for decimating a polyline to a simpler polyline

License

Notifications You must be signed in to change notification settings

Kayal314/RDP-Visualization

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

RDP-Visualization

Visualization of the Ramer Douglas Peucker algorithm, an iterative end-point fit algorithm for decimating a polyline to a simpler polyline

The function used in the code (as shown in the above image) is
f(x)=e-xcos(2πx) for x in [0, 5] as used in the wikipedia article RDP algorithm
The example function, variation of epsilon (inversely related to the fidelity of the approximated polyline), and the domain of x can be varied by the user
Further, in the implemented program, code to plot the original polyline (in grey (solid)) (not shown above) along with the simplified polyline (in red (dashed)) has also been provided

About

Visualization of the Ramer Douglas Peucker algorithm, an iterative end-point fit algorithm for decimating a polyline to a simpler polyline

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published