How'd you make out with this?
I had a co-planar algorithm that would check all loaded trines/quads in a .dat file for overlap by if they had the same normal and if more than one of line segments that defined their edges crossed. Coincidental edges were ignored unless there were more than one to avoid failing out on seams.
Unfortunately that got lost in-between computers, and I don't have it any more.
I'm currently reworking my lost Java API for parsing dat files.
You can Google algorithms for calculating normals, as well as angles or distance between lines. Linear Algebra was a long time ago for me, I'd have to look up them up myself!
I had a co-planar algorithm that would check all loaded trines/quads in a .dat file for overlap by if they had the same normal and if more than one of line segments that defined their edges crossed. Coincidental edges were ignored unless there were more than one to avoid failing out on seams.
Unfortunately that got lost in-between computers, and I don't have it any more.
I'm currently reworking my lost Java API for parsing dat files.
You can Google algorithms for calculating normals, as well as angles or distance between lines. Linear Algebra was a long time ago for me, I'd have to look up them up myself!
- Greg
"The only stupid question is the one that remains unasked"
"The only stupid question is the one that remains unasked"