Java Programming

Hello all,

I am attempting to design a program that will take a set of n line segments and check which pairs of lines intersect. The lines are finite line segments, and they each have two end-points. I am supposed to be able to store a good amount of "Line Segments" into a data structure (Array, LinkedList, BinarySearchTree), etc. I am then supposed to be able to test each line segment against all of the other line segments that are read in in a text file in the format L1: (x,y),(x,y)

I figured out how to test whether or not two finite line segments intersect, that is not the problem. What I am concerned with is the method(s) I can use to read in all of the line segments and then output the intersecting pairs of line segments in the form (L1,L2) means Line segment 1 and Line segment 2 intersect.

I was thinking that reading the text file, I could just create an array with n slots that holds Line Segment objects (assuming I have created a Point class for keeping track of end-points), start with the first line segment in the array, and use the points from the first line segment's endpoints to all of the other line segment's endpoints in the array and check to see if they do intersect. Has anybody ever had to do something like this, and if so, what approach did you take to complete?

Thanks in advance.