Fast 3D Line Segment (float , no thickness) Intersection Detection.
In my current project I have tons of linear 3D line segments and I want to check its intersections. In the 2D world the line sweep algorithm would solve exactly this problem. Anyone know a solution for the 3D world ? Algorithms ? Collision packages ?
Thank you
Peter
1 Attachment(s)
Find the equivalent intersection point of multi lines in 3D space
Thanx for you answer !
I think I have described the problem imprecisely. The problem is not the function for the intersection of the lines the problem is the quantity of the comparisons to find the knots. Please look at the attached pic.
Thank you