Does any one have a piece of Java code that implements the Douglas-Peucker vertex reduction algorithm? This algorithm reduces the number of 2D points on a path.
http://www.cs.mcgill.ca/~stever/pattern/old-demos.html
You might also want to check this article: http://citeseer.nj.nec.com/hershberger92speeding.html
I gave it a quick look and it contains an algorithm that improves on D-P
Also here: http://geometryalgorithms.com/Archive/algorithm_0205/algorithm_0205.htm
I'm going to also implement this in my software; provide vertex reduction with several options of interpolation as a filter plugin. In my framework the interpolation options are also plugins.
Best, --Mike
Egregious "Spiritual renewal through music for those outside the heard." http://www.egregious.net/
=========================================================================== To unsubscribe, send email to [EMAIL PROTECTED] and include in the body of the message "signoff JAVA2D-INTEREST". For general help, send email to [EMAIL PROTECTED] and include in the body of the message "help".
