RE: [Algorithms] Tris intersection
Brought to you by:
vexxed72
From: Robert D. <RD...@ac...> - 2000-07-25 07:58:13
|
Yup, thats what that suggestion from someone else does, in coplanar cases - in fact its quite neat, I wish I'd thought of it. Just test for intersection (total of 9 intersection tests any one of which can return true - very nice if you expect most cases to intersect) and then if still not determined just test if any point of one is in the other, which because there are now no intersections means you only have to test one point of each against the other. Rob -----Original Message----- From: Steve Wood [mailto:Ste...@im...] Sent: 24 July 2000 17:52 To: 'gda...@li...' Subject: RE: [Algorithms] Tris intersection Oh...your right...checking to see if any of the line segments intersect would be a better test. R&R |