Yep, I'm not very busy today...
And, I just learned about a really neat algorithm! And... I can't explain it any better than this. So here is the link: http://marblemice.com/2007/09/12/douglas-peuker-line-simplification-explained/
Its so simple and yet elegent!
However, there is also another algorithm I've seen for this which used dynamic programming. We learned it in my algos class at Cornell. I'm lucky that the chapter is on the book's website here (go to section 6.3.):
I'm curious to see how they compare, but haven't had time to compare them at all yet. I'll get around to it, but the douglas-peuker algorithm reminded me of the dynamic programming approach and I decided to put it up here.
No comments:
Post a Comment