All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Algorithms
Intersecting lines (Posted on 2003-07-01) Difficulty: 3 of 5
You are given two straight line segments, each defined by the coordinates of its endpoints. Segment AB goes from (Ax,Ay) to (Bx,By) and segment CD - from (Cx,Cy) to (Dx,Dy).

How would you determine if the two line segments intersect?

(Assume that you can't just draw the lines and see)

See The Solution Submitted by levik    
Rating: 4.0000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Points on an ellipse | Comment 18 of 20 |
(In reply to Points on an ellipse by brianjn)

If AB extends from (-4,1) to (4,1) and CD extends from (-4,-1) to (4,-1), all the endpoints lie on the 'circumference' of an ellipse. In fact I think an ellipse can be constructed using any four points.

Also, what is one to do if the four points given all lie on one line? The algorithm is required to say either yes or no. If point C is between A and B or D is between A and B, then the line segments share points and can be said to intersect, while if line AB is disjoint from line CD, they do not.

As a geometric solution, there is still my original proposal that ACBD forms a non-concave quadrilateral (either convex, or having a 180-degree angle or two).
  Posted by Charlie on 2003-07-08 08:44:37

Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information