I would like to find a fast powerful java code that finds all the intersections between poly lines. I tried to use the code found in the ""Algorithms in a Nutshell" book but it breaks with my huge data input.
What is a poly line?
Do you have a situation where the number of possible intersections to test for increases exponentially? That could make even the fastest algorithm perform poorly as the problem increases in size.