[SciPy-Dev] scipy 0.11.0 release schedule

[Pauli Virtanen]

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