KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I need a fast algorithm for checking if two non-infinite lines are crossing. Have to be fast because it'll run on a cell phone a lot. The algorithm do only have to return yes or no, it does not have to find out exactly where the lines cross! I have looked here: How do you detect where two line segments intersect? But that thread is a jungle, people keep saying that "this is the answer" but then two other guys say that it is incorrect because of this-and-that bug. Please help me find a good and working algorithm for this. Just to be clear: I need a function that you give... lineApointAx lineApointAy lineApointBx lineApointBy lineBpointAx lineBpointAy lineBpointBx lineBpointBy ...and that returns true or false depending on if the two lines cross or not. I would appreciate if you answered with (pseudo-)code, not formulas.
Tags (comma-separated)
Save Edits
Cancel