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 have two curves, which are given by sets of values:

$C = [( x{_1} ,y{_1}),(x{_2},y{_2}),(x{_3},y{_2}),...,(x{_n},y{_n})]$

$C^' = [( x^'{_1} ,y^'{_1}),(x^'{_2},y^'{_2}),(x^'{_3},y^'{_2}),...,(x^'{_m},y^'{_m})]$

where $m \ne n$

Is there any criteria to determine if these curves are intersects or not (I need to find only fact of intersection). If yes, it would be great to determine if they intersect odd or even times.

share|improve this question

2 Answers 2

This is basically the same as the Polygon intersection problem.

One possible difficulty is how your curves are defined. For example, I can give you two discrete triangles that have overlapping circumcircles.

share|improve this answer
    
Thank you for link! It may be very useful, but here I am expecting math answer without any programming –  Anton Semenov Jun 10 '11 at 6:53

One way I can think of is to test if each line segment $(x_i, y_i)$ in the first curve intersects any line segment $(x'_j,y'_j)$

share|improve this answer
    
Yes, it seems to be right answer, but how can I rewrite it in math form? –  Anton Semenov Jun 10 '11 at 6:54

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.