Hi Rob & All,
On Sat, Sep 27, 2008 at 4:05 PM, Rob Clewley wrote:
> Hi Andrea,
>
>>I was wondering if someone had any suggestions/references/snippets
>> of code on how to find the minimum distance between 2 paths in 3D.
>> Basically, for every path, I have I series of points (x, y, z) and I
>>
On Sat, Sep 27, 2008 at 11:18 PM, Anne Archibald
<[EMAIL PROTECTED]> wrote:
>
> I think a kd-tree implementation would be a valuable addition to
> scipy, perhaps in a submodule scipy.spatial that might eventually
> contain other spatial data structures and algorithms. What do you
> think? Should we
2008/9/27 Robert Kern <[EMAIL PROTECTED]>:
> On Sat, Sep 27, 2008 at 15:23, Anne Archibald <[EMAIL PROTECTED]> wrote:
>> 2008/9/27 Andrea Gavana <[EMAIL PROTECTED]>:
>>
>>>I was wondering if someone had any suggestions/references/snippets
>>> of code on how to find the minimum distance between
On Sat, Sep 27, 2008 at 15:23, Anne Archibald <[EMAIL PROTECTED]> wrote:
> 2008/9/27 Andrea Gavana <[EMAIL PROTECTED]>:
>
>>I was wondering if someone had any suggestions/references/snippets
>> of code on how to find the minimum distance between 2 paths in 3D.
>> Basically, for every path, I ha
On Sep 27, 2008, at 10:23 PM, Anne Archibald wrote:
> Sadly, no such data structure exists
> in either numpy or scipy, though biopython apparently has an
> implementation of kd-trees.
It's not part of scipy but I saw there was a scikit which supported ANN:
http://scipy.org/scipy/scikits/wiki/
2008/9/27 Andrea Gavana <[EMAIL PROTECTED]>:
>I was wondering if someone had any suggestions/references/snippets
> of code on how to find the minimum distance between 2 paths in 3D.
> Basically, for every path, I have I series of points (x, y, z) and I
> would like to know if there is a better
Hi Andrea,
>I was wondering if someone had any suggestions/references/snippets
> of code on how to find the minimum distance between 2 paths in 3D.
> Basically, for every path, I have I series of points (x, y, z) and I
> would like to know if there is a better way, other than comparing
> point
Hi All,
I was wondering if someone had any suggestions/references/snippets
of code on how to find the minimum distance between 2 paths in 3D.
Basically, for every path, I have I series of points (x, y, z) and I
would like to know if there is a better way, other than comparing
point by point th
