Developers of Scientific Python

headers Ralf Gommers | 28 May 2012 17:26

_______________________________________________
SciPy-Dev mailing list
SciPy-Dev <at> scipy.org
http://mail.scipy.org/mailman/listinfo/scipy-dev

> Hi all,
> 
> It's time for a new release I think; 0.10.0 was released just over 6
> months ago. There are a lot of PRs to merge, but no release blockers
> anymore as far as I know. Does anyone still have important fixes or
> other things that should go in?

Though it's by no means important, I personally would really appreciate
if https://github.com/scipy/scipy/pull/192 could go in.

Andreas.

_______________________________________________
SciPy-Dev mailing list
SciPy-Dev <at> scipy.org
http://mail.scipy.org/mailman/listinfo/scipy-dev

Hi,

28.05.2012 17:26, Ralf Gommers kirjoitti:
> It's time for a new release I think; 0.10.0 was released just over 6
> months ago. There are a lot of PRs to merge, but no release blockers
> anymore as far as I know. Does anyone still have important fixes or
> other things that should go in?
> 
> For the release schedule I propose:
> June  7: beta 1
> June 17: rc 1
> June 30: rc 2
> July  7: final release

The schedule seems possible.

I'd like to get in as many as possible of the open PRs and any "nearly
easy" stuff from the Trac. There are also a couple of low-hanging
bugfixes in scipy.special listed in the Trac that are short of some
quality time with Abramowitz&Stegun on verifying that the fixes are correct.

Finally, making the Qhull wrappers expose circumcenters (for easy
Voronoi) and allow passing in custom Qhull options could also be useful,
and not too difficult to do. I'll see how much of this gets done.

	Pauli

Pauli,
If you look at QHull, could you check if there's an easy way for it to 
expose information on edges as well?  (that is, a listing of the 
segments connecting the points which define the simplexes).  If we had 
that, it could be combined with the new csgraph tools to allow a very 
fast computation of euclidean minimum spanning trees for spatial 
clustering.  I'm not aware of any good python implementation of EMST 
available currently.
   Jake

Pauli Virtanen wrote:
> Hi,
>
> 28.05.2012 17:26, Ralf Gommers kirjoitti:
>   
>> It's time for a new release I think; 0.10.0 was released just over 6
>> months ago. There are a lot of PRs to merge, but no release blockers
>> anymore as far as I know. Does anyone still have important fixes or
>> other things that should go in?
>>
>> For the release schedule I propose:
>> June  7: beta 1
>> June 17: rc 1
>> June 30: rc 2
>> July  7: final release
>>     
>
> The schedule seems possible.
>
> I'd like to get in as many as possible of the open PRs and any "nearly
> easy" stuff from the Trac. There are also a couple of low-hanging
> bugfixes in scipy.special listed in the Trac that are short of some
> quality time with Abramowitz&Stegun on verifying that the fixes are correct.
>
> Finally, making the Qhull wrappers expose circumcenters (for easy
> Voronoi) and allow passing in custom Qhull options could also be useful,
> and not too difficult to do. I'll see how much of this gets done.
>
> 	Pauli
>
> _______________________________________________
> SciPy-Dev mailing list
> SciPy-Dev <at> scipy.org
> http://mail.scipy.org/mailman/listinfo/scipy-dev
>   

30.05.2012 21:03, Jacob VanderPlas kirjoitti:
> If you look at QHull, could you check if there's an easy way for it to 
> expose information on edges as well?  (that is, a listing of the 
> segments connecting the points which define the simplexes).  If we had 
> that, it could be combined with the new csgraph tools to allow a very 
> fast computation of euclidean minimum spanning trees for spatial 
> clustering.  I'm not aware of any good python implementation of EMST 
> available currently.

That's currently implicitly contained in the adjacency information (the
`neighbors` attribute).

The edge between simplex and its j-th neighbor consists of its vertices,
excluding the j-th one. Sounds like that might be extracted with some
slicing and a range(ndim) for loop. Needs some filtering out of the -1
entries in the neighbor array, though...

But this could also be added as a new attribute. The information can be
lazily computed when first accessed, so there's no memory penalty.

	Pauli

30.05.2012 21:24, Pauli Virtanen kirjoitti:
> 30.05.2012 21:03, Jacob VanderPlas kirjoitti:
>> If you look at QHull, could you check if there's an easy way for it to 
>> expose information on edges as well?  (that is, a listing of the 
>> segments connecting the points which define the simplexes).  If we had 
>> that, it could be combined with the new csgraph tools to allow a very 
>> fast computation of euclidean minimum spanning trees for spatial 
>> clustering.  I'm not aware of any good python implementation of EMST 
>> available currently.
> 
> That's currently implicitly contained in the adjacency information (the
> `neighbors` attribute).
[clip]

Sorry, those were the ridges (or facets). The 1-d edges (pruned for
duplicates) could also be useful to get easily.

	Pauli

_______________________________________________
SciPy-Dev mailing list
SciPy-Dev <at> scipy.org
http://mail.scipy.org/mailman/listinfo/scipy-dev

_______________________________________________
SciPy-Dev mailing list
SciPy-Dev <at> scipy.org
http://mail.scipy.org/mailman/listinfo/scipy-dev

scipy 0.11.0 release schedule

Re: scipy 0.11.0 release schedule

Re: scipy 0.11.0 release schedule

Re: scipy 0.11.0 release schedule

Re: scipy 0.11.0 release schedule

Re: scipy 0.11.0 release schedule

Re: scipy 0.11.0 release schedule

Re: scipy 0.11.0 release schedule

Re: scipy 0.11.0 release schedule