Quote Originally Posted by jemidiah View Post
Implementing that paper, at a glance, looks like a mess to code and debug. Using a library is probably the way to go, even if it's pretty inconvenient in other places.
The thing is I have a full implementation of a clipping algorithm that I worked out on my own after I had read a different paper dealing with some basic algorithm. But the part yet to be implemented is precisely the extension to degenerate cases explained in this paper. I'd love to understand it so I could take the challenge of finishing my clipping algorithm.
Quote Originally Posted by jemidiah View Post
The general algorithm I outlined above should deal pretty well with concave cases. Is there a specific part of your implementation that doesn't deal with them well? (I know there are some bugs as pointed out above; perhaps that's the problem.)
I'm not sure, sometimes it deals well with concave cases, sometimes it doesn't. As you point out it may be that some of the bugs that crept in are making the algorithm fail in some special examples. As I said, I must find time to calmly sit down and try take care of the bugs.