Skip to main content

Find a set of points with the same distance in a euclidean matrix Python

I have a list with coordinates and this Euclidean matrix which represents the distance between each point:

 [0, 0], [0, 1], [0, 2], [0, 3], [0, 4]

 [0. 1. 2. 3. 4.]
 [1. 0. 1. 2. 3.]
 [2. 1. 0. 1. 2.]
 [3. 2. 1. 0. 1.]
 [4. 3. 2. 1. 0.]

And what I want to do is check how many sets of two distinct but equal-length line segments which have one shared endpoint exists, for example: As we can see in the following image from the coordinate (0,0) to the coordinate (0,1) there is a distance equal to 1 and from the coordinate (0,2) to the coordinate (0,1) there is a distance equal to 1 (we already have two line segments with the same distance) and both share a point at the coordinate ( 0, 1).

As shown in the following image:

Segments and sharepoint enter image description here

S1 represents the segment from the point (0, 0) to the point (0, 1) and S2 the segment from the point (0, 2) to the point (0, 1).

And what I want as my output is the number of cases that match the requirements that I mentioned above, in the images below we can see that there are 4 cases that match the requirements.

enter image description here enter image description here enter image description here

How would it be implemented in python? And is there a library that facilitates this analysis?

I was thinking of divide the euclidean matrix in two halves and then compare if they have the same distance and a zero in the middle, if it's the case then it's a match, but I don't know how to manipulate the matrix in order to do that.



source https://stackoverflow.com/questions/73186540/find-a-set-of-points-with-the-same-distance-in-a-euclidean-matrix-python

Labels

Labels:

Comments

Post a Comment

Popular posts from this blog

How to split a rinex file if I need 24 hours data

Trying to divide rinex file using the command gfzrnx but getting this error. While doing that getting this error msg 'gfzrnx' is not recognized as an internal or external command Trying to split rinex file using the command gfzrnx. also install'gfzrnx'. my doubt is I need to run this program in 'gfzrnx' or in 'cmdprompt'. I am expecting a rinex file with 24 hrs or 1 day data.I Have 48 hrs data in RINEX format. Please help me to solve this issue. source https://stackoverflow.com/questions/75385367/how-to-split-a-rinex-file-if-i-need-24-hours-data
Post a Comment
Read more

ValueError: X has 10 features, but LinearRegression is expecting 1 features as input

So, I am trying to predict the model but its throwing error like it has 10 features but it expacts only 1. So I am confused can anyone help me with it? more importantly its not working for me when my friend runs it. It works perfectly fine dose anyone know the reason about it? cv = KFold(n_splits = 10) all_loss = [] for i in range(9): # 1st for loop over polynomial orders poly_order = i X_train = make_polynomial(x, poly_order) loss_at_order = [] # initiate a set to collect loss for CV for train_index, test_index in cv.split(X_train): print('TRAIN:', train_index, 'TEST:', test_index) X_train_cv, X_test_cv = X_train[train_index], X_test[test_index] t_train_cv, t_test_cv = t[train_index], t[test_index] reg.fit(X_train_cv, t_train_cv) loss_at_order.append(np.mean((t_test_cv - reg.predict(X_test_cv))**2)) # collect loss at fold all_loss.append(np.mean(loss_at_order)) # collect loss at order plt.plot(np.log(al...
Post a Comment
Read more

Sorting large arrays of big numeric stings

I was solving bigSorting() problem from hackerrank: Consider an array of numeric strings where each string is a positive number with anywhere from to digits. Sort the array's elements in non-decreasing, or ascending order of their integer values and return the sorted array. I know it works as follows: def bigSorting(unsorted): return sorted(unsorted, key=int) But I didnt guess this approach earlier. Initially I tried below: def bigSorting(unsorted): int_unsorted = [int(i) for i in unsorted] int_sorted = sorted(int_unsorted) return [str(i) for i in int_sorted] However, for some of the test cases, it was showing time limit exceeded. Why is it so? PS: I dont know exactly what those test cases were as hacker rank does not reveal all test cases. source https://stackoverflow.com/questions/73007397/sorting-large-arrays-of-big-numeric-stings
Post a Comment
Read more