daviddoji/numpy-100
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Merge pull request #4 from italmassov/master

Browse Source 
proposing solution to question 52, although trivial
This commit is contained in:
Nicolas P. Rougier
2015-08-22 09:18:17 +02:00
parent 7cdef30736 4d72e2e9a8
commit 9d8a7ad876
1 changed files with 7 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
README.rst
View File

@@ -1,4 +1,4 @@
=================== ===================
100 numpy exercises 100 numpy exercises
=================== ===================
@@ -597,9 +597,12 @@ Thanks to Michiaki Ariga, there is now a
how to compute distance from each point j (P[j]) to each line i (P0[i],P1[i]) ? how to compute distance from each point j (P[j]) to each line i (P0[i],P1[i]) ?
.. code-block:: python .. code-block:: python
# Author: Italmassov Kuanysh
Answer needed actually # based on distance function from previous question
P0 = np.random.uniform(-10, 10, (10,2))
P1 = np.random.uniform(-10,10,(10,2))
p = np.random.uniform(-10, 10, (10,2))
print np.array([distance(P0,P1,p_i) for p_i in p])
#. Consider an arbitrary array, write a function that extract a subpart with a #. Consider an arbitrary array, write a function that extract a subpart with a
fixed shape and centered on a given element (pad with a ``fill`` value when fixed shape and centered on a given element (pad with a ``fill`` value when