Wednesday, June 25, 2008

V-Clip algorithm (status update)

Finally, I've found an algorithm which should be relatively easy to implement. It is Mirtich's V-Clip algorithm described in this paper.

It is similar to Lin-Canny algorithm (they both are based on Voronoi regions and even uses the same theorem), but advantage of V-Clip is that it avoids finding the closest points of two features (that was the problem I could not resolve last week).

So, I'm going to dive deeply in the paper and try to implement that algorithm.

No comments: