I was doing so research today, and it seems that they way to go is with a plane ( or line ) sweep algorithm. Is this a good route to take?
Another one I saw, but haven't done the research yet, is the Bentley-Ottmana line segment intersection algorithm.
Just looking for a good point in the right direction. I think this might be my next thing to tackle, and don't want to stray too far from a good path. I'm just looking for ideas and recommendations on theories to investigate.
Thanks in advance. Off to see about the B-O intersection algo. now.