I have a huge list of points and curves,Where I have to run “does intersects node” between each point and all lines.I have around 300 points and 800 lines thus making the graph never complete.

creating a bounding box around points and lines helped to increase the speed but its still takes 30-40 mins for each run.

my goal is to check for intersection of lines with every point and hence **find the adjacent points.**

as in the image it has to generate around 3 lakh outputs for a simple grid of 7x7x7.

Please let me know if you have any idea that uses less of computation power.