On Tue, Jul 29, 2014 at 12:47 PM, Josè Luis Mietta
joseluismie...@yahoo.com.ar wrote:
Robert, thanks for your help!
Now I have:
* Q nodes (Q stick-stick intersections)
* a list 'NODES'=[(x,y,i,j)_1,, (x,y,i,j)_Q], where each element
(x,y,i,j) represent the intersection point
On 29 Jul 2014, at 02:43 pm, Robert Kern robert.k...@gmail.com wrote:
On Tue, Jul 29, 2014 at 12:47 PM, Josè Luis Mietta
joseluismie...@yahoo.com.ar wrote:
Robert, thanks for your help!
Now I have:
* Q nodes (Q stick-stick intersections)
* a list 'NODES'=[(x,y,i,j)_1,,
Hi experts!
Im working with conductivity of sticks film - systems.
In my
algorithm (N sticks) I have the intersection graph matrix M (M is a NxN
matrix, M_ij=1 if sticks 'i' and 'j' do intersect, and M_ij=0 if sticks
'i' and 'j' do not).
Also I have 2 lists with the end-points of each
What have you tried? What exactly are you having problems with? Loosely, I
would suggest the following approach:
For each stick, iterate over each stick that intersects with it (as
recorded in M). Find the coordinates of all of the intersection points.
Label the intersection points by the IDs of
