Thanks a lot!!
José Luis
De: Brett Olsen brett.ol...@gmail.com
Para: Discussion of Numerical Python numpy-discussion@scipy.org
Enviado: lunes, 26 de agosto de 2013 14:08
Asunto: Re: [Numpy-discussion] Stick (line segments) percolation algorithm -
graph
I can see a couple opportunities for improvements in your algorithm.
Running your code on a single experiment, I get about 2.9 seconds to run.
I get this down to about 1.0 seconds by (1) exploiting the symmetry of the
M matrix and (2) avoiding the costly inner loop over k in favor of array
Hi experts!
I wrote an algorithm for study stick percolation (i.e.: networks between line
segments that intersect between them). In my algorithm N sticks (line segments)
are created inside a rectanglar box of sides 'b' and 'h' and then, one by one,
the algorithm explores the intersection
