[Numpy-discussion] Stick intersection path algorithm
Josè Luis Mietta
joseluismietta at yahoo.com.ar
Sun Sep 1 18:55:04 EDT 2013
I wanna study the intersection between line segments (sticks).
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).
Given two arbitrary sticks, i need a simple and effective algorithm that determinate if that two sticks are conected by a 'intersected-sticks' path.
Any idea for that?
Thanks a lot!
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the NumPy-Discussion