Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I've got a programming exercise I need to do, but I just can't figure out the math part.

I need to check if 3 of 6 lines intersect in the same point. I am given the equation ax+by=c, and I input random numbers in a,b,c. How would I go about solving this mathematically?

Thanks!

share|improve this question
add comment

3 Answers

up vote 3 down vote accepted

You're trying to check for the condition of concurrency of three lines; the last determinant formula involving the coefficients of your three lines in that link may be of help.

Once you've shown that your three lines are concurrent, take any two of the three and solve as simultaneous equations (two equations in two unknowns) to get the coordinates of the intersection point.

share|improve this answer
1  
If you check for concurrency of 3 lines using the determinant formula at the link in the answer above, note that the description involves writing the equation of a line in homogeneous coordinates. The line ax + by = c in this environment would be al + bm - cn = 0. If exactly two of the lines are parallel (but distinct) then one will be certain the the determinant will not be zero. If the three lines are distinct but all three parallel then the determinant will be zero because the condition stated involves concurrency in the "real projective plane" and three parallel lines "meet" at infinity. –  Joseph Malkevitch Sep 23 '10 at 1:02
    
I was talking about equation 9 in that link, but the three parallel lines "intersecting at infinity" works too. :) –  J. M. Sep 23 '10 at 1:21
    
Thanks for the info. I ended up using this very approach. –  Janis Peisenieks Sep 23 '10 at 7:59
add comment

The first step to write a program is to break down a problem into small parts. I would do the following:

  1. Write a function to decide whether given three lines intersect at one point. J. M.’s answer gives some material to do this.
  2. Iterate over all combinations of three lines out of six.

If the program does not work, try to test the two parts separately. Smaller, simpler programs are easier to verify.

share|improve this answer
1  
Agreed, the "Unix philosophy" works well in this case: keep the concurrency test and the routine for taking three lines at a time separate. –  J. M. Sep 23 '10 at 2:00
    
Thanks, that's exactly what I did. As I just needed to know, if there are at least 3 lines that intersect at a single point, this method worked out quite well. –  Janis Peisenieks Sep 23 '10 at 8:00
add comment

HINT:$\;$ Divide and conquer. $\:$ Split the lines into two sets of three lines. Compute the intersection points of each set (at most three). If either intersection set has cardinality one then you're done. Else check if any intersection point from one set lies on any line in the other set. Total operation count: 6 line intersections and 6 line evaluations.

Note: if the lines need not be distinct then you need to make slight modifications to the above.

share|improve this answer
    
Thanks. Im trying something different here, and it's not working, so i'll check out your suggestion! –  Janis Peisenieks Sep 23 '10 at 0:59
    
Looks like 18 "line evaluations" to me. –  Robin Chapman Sep 23 '10 at 18:25
    
Yup, they were :) –  Janis Peisenieks Sep 23 '10 at 20:33
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.