Algorithm to calculate intersection of line segments.

Question

0.00/5 (No votes)

See more:

C#

Does anyone know an algorithm to calculate intersection of line segments?

Posted 21-Nov-12 22:37pm

gilvani

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CPallini · Answer 1 · 2012-11-21T22:47:00

Solution 1

Google[^] knows.

You may also refresh a bit your geometrical studies and directly apply them.

Posted 21-Nov-12 22:47pm

CPallini

Comments

Sergey Alexandrovich Kryukov 22-Nov-12 4:52am

Good points, especially the second one. By the way, in the digital world, the problem is less trivial than in "regular" analythical geometry... precision loss and other nice things...
My 5.
--SA