Sorry for not responding in a more timely fashion! I swear, by the time I’m on my computer, I’m just too tired to post.
Anyway, I’m doing the same type of thing that Shewchuk is. I need the equivalent of his orientation routines, only I’m trying to do it in a faster manner.
There was some paper (I can find the link if need be) where they treat a tetrahedron as three independent vectors and you can find how they combine to represent a specific point so you can find out if the point is inside/on the tetrahedron.
I was hoping there’d be some library I could use so all I would have to do is worry about just writing the Gaussian solver (btw, that was an amazing suggestion [much easier]) but alas, I guess it’s not meant to be.
I think one thing to do would be to write the code but track some error parameter, epsilon, and then perform the Shewchuk tests should the need present itself. It doesn’t sound very performant but I suppose safe is better than fast.
But I wanna be fast too! XD
Sorry, now I’m just being childish. Thanks for taking the time to reply to me!