RE: [Plib-devel] Is a point inside a triangle in 3-d

[Fay J. F C. AAC/W. <joh...@eg...>]

So:  are we interested in a fast "point-in-triangle" algorithm for SG?  As I
see it, we have three alternatives:

(1) Keep what we have.
(2) Keep what we have and add new functions "sgFastPointInTriangle*" for
applications where it is not crucial that a point fall inside one, and only
one, triangle in a lattice.
(3) Replace what we have with the new algorithm.

Since I haven't done all my homework on the present algorithm and the new
algorithm, I advocate (1).  On the other hand, if I find (in my copious free
time) that the present algorithm will miss points in a lattice of triangles,
you will be hearing about it from me.  For one thing, the present algorithm
goes to "NaN" with degenerate triangles.

John F. Fay
joh...@eg...