Hi all,
I'm happy to announce the first beta release of Numpy 1.8.0. Please try
this beta and report any issues on the numpy-dev mailing list.
Source tarballs and release notes can be found at
https://sourceforge.net/projects/numpy/files/NumPy/1.8.0b1/. The Windows
and OS X installers will
On 1 September 2013 18:54, Charles R Harris charlesr.har...@gmail.comwrote:
I'm happy to announce the first beta release of Numpy 1.8.0. Please try
this beta and report any issues on the numpy-dev mailing list.
In an old thread there was discussion about adding minmax and sincos; is
there a
On Sun, Sep 1, 2013 at 11:15 AM, Daπid davidmen...@gmail.com wrote:
On 1 September 2013 18:54, Charles R Harris charlesr.har...@gmail.comwrote:
I'm happy to announce the first beta release of Numpy 1.8.0. Please try
this beta and report any issues on the numpy-dev mailing list.
In an old
Hello all,
I was noticing that `np.triu_indices` took quite awhile and discovered it
creates an upper triu array and then uses `np.where`. This seems quite
inefficient and I was curious if something like the following would be better:
def fast_triu_indices(dim,k=0):
tmp_range =
Hi experts!
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
On Sun, Sep 1, 2013 at 3:55 PM, Josè Luis Mietta
joseluismie...@yahoo.com.ar wrote:
Given two arbitrary sticks, i need a simple and effective algorithm that
determinate if that two sticks are conected by a 'intersected-sticks' path.
do you mean a test to see if two line segments intersect?
Hi Chris.
I wanna see if two line segments are connected by a path formed by line
segments intersected.
Waiting for your answers.
Thanks a lot!
De: Chris Barker - NOAA Federal chris.bar...@noaa.gov
Para: Discussion of Numerical Python numpy-discussion@scipy.org
Enviado: domingo, 1 de
On 2 September 2013 02:50, Josè Luis Mietta joseluismie...@yahoo.com.arwrote:
I wanna see if two line segments are connected by a path formed by line
segments intersected.
You could build a network where each segment is a node and an intersection
is a link. Then, you could use NetworkX
