How to find the most similar sub list of another list? Python

Question

0.00/5 (No votes)

See more:

I have a list of 60 sublists. Each sublist has 30 sub-sub lists. Each sub-sub-list looks like [x, y] For each sub-sub lists, how can I find the closest sub-sub list of the next sub-list?

For example, I am in sub-list[0], sub-sub-list[0]. Now I go to sub-list[1] and search for the sub-sub-list that has the closest x,y coordinates.

This is an example of what I am trying to accomplish:

input = [ [[99, 87], [400, 500], [300, 95]],
[[297, 107], [100, 118], [405, 450]] ]

output = [ [[99, 87],[100, 118]], [[400, 500], [405, 450]], [[300, 95], [297, 107]] ]

What I have tried:

I have tried something like this, maybe calculate the smallest distance between the x and y coordinates between a subsublist and another subsublist of another sublist..

Python

for i in range(1,len(listt)):
    for sublist[i] in listt:
        for j in range(len(sublist[i]))
            for subsublist[j] in sublist[i]:

Posted 11-Apr-19 3:08am

iliketocode

Updated 11-Apr-19 16:40pm

Patrice T

v4

Add a Solution

Comments

Patrice T 11-Apr-19 10:57am

Show a sample of your data.
List 1
SubList 11
SubSubList 111
SubSubList 112
SubList 12
...

iliketocode 11-Apr-19 11:19am

This is an example of what I am trying to accomplish:
input = [ [[99, 87], [400, 500], [300, 95]],
[[297, 107], [100, 118], [405, 450]] ]

output = [ [[99, 87],[100, 118]], [[400, 500], [405, 450]], [[300, 95], [297, 107]] ]

Patrice T 11-Apr-19 11:37am

Use Improve question to update your question.
So that everyone can pay attention to this information.

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Gerry Schmitz · Answer 1 · 2019-04-11T08:13:00

Solution 1

You're dealing with "points"; so you can calculate the distance between any 2 points and find the one that is closest.

c# - Calculating the distance between 2 points - Stack Overflow[^]

Posted 11-Apr-19 8:13am

Gerry Schmitz

Patrice T · Answer 2 · 2019-04-11T16:40:00

Quote:
How to find the most similar sub list of another list?

First, you need to understand the problem, and reformulating in a clear way is a good start.

Quote:
Each sub-sub-list looks like [x, y]

Each sub-sub-list is x and y coordinates of what is commonly named a point.
The concept of point makes it easier to understand the problem.

Quote:
how can I find the closest sub-sub list of the next sub-list?

Is reformulated as: for a given point, how to find closest point in a list of points?
This is the heart of your problem.
In your problem, lists are just a repeat of same problem.

Unless you give more details, brute force is probably the best approach.

To get help on your code, show it and explain where you are stuck.