15
Hi,
I have millions of 3D line segments. Each segment is denoted by a point at each end. One line segment would be v1, v4 (where v1 and v4 are 3D vectors given as x,y,z). If multiple lines radiate out from one point there will be multiple lines for that point (theoretical v1 could have an infinite number of lines radiating out). There is no ordering in the assignment of x,y,z to points or in the numbering of points - both are random. There may be 2 or more line segments which form a continuous straight line (v1, v4, v17, vn). I want to find those longer lines and have a single segment replace the multiple segments (v1, v4, v17, vn results in v1, vn). I can find the lines which are continuations using cross product. I also have processor and memory issues (neither unlimited) and a time constraint. My question, is there a way to search for line segments radiating from a point (currently I am checking each segment for a point - very inefficient to implement but works ok for testing small numbers of segments ).
Thanks in advance for any help.
