<html><body><div style="color:#000; background-color:#fff; font-family:times new roman, new york, times, serif;font-size:10pt"><div><font size="2">Hi experts!</font></div><div><font size="2"><br></font></div><div><font size="2">I wanna study the intersection between line segments (sticks).</font></div><div><font size="2">I wrote a algorithm that generate a matrix, M, with N rows and N columns. The M-element Mij is 1 if stick number 'i' intersect stick number 'j' (obviously M is symmetric).</font></div><div><font size="2"><br></font></div><div><font size="2">Given two arbitrary sticks, i need a simple and effective algorithm that determinate if that two sticks are conected by a 'intersected-sticks' path.</font></div><div><font size="2"><br></font></div><div><font size="2">Any idea for that?</font></div><div><font size="2"><br></font></div><div><font size="2">Thanks a lot!</font></div><div style="font-family: 'times new roman', 'new york', times, serif;
font-size: 10pt;"><br></div></div></body></html>