« Homework Syllabus for all sect | Main | Project 1Syllabus for all sect »
January 26, 2006
One very Syllabus for all sect
In my implementation, this one was essential and it makes the algorithm potentially incorrect. So I thought I'd tell you about it and tell you that you can use it.
The optimization is to consider Dijkstra's only in the rectangle bounded by the starting segmentation point and the ending segmentation point. This kept my algorithm from wandering all over the image. And, the resulting segments are pretty good.
You are free to bound your Dijkstra search by whatever you want. I found a rectangle most convenient since it is easy to tell if a point is inside or outside of the rectangle. You can use a circle, triangle, whatever.
Posted by jones at January 26, 2006 04:11 PM
Comments
Post a comment
Thanks for signing in, . Now you can comment. (sign out)
(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)