使用python对点进行排序以具有连续曲线 [英] sort points in order to have a continuous curve using python

查看:413
本文介绍了使用python对点进行排序以具有连续曲线的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

我有一个未排序的点的列表:

I have a list of unsorted points:

列表= [(-50.6261,74.3683),(-63.2489,75.0038),(-76.0384,75.6219),(-79.8451,75.7855),(-30.9626,168.085),(-27.381,170.967),(- 22.9191,172.928),(-16.5869,173.087),(-4.813,172.505),(-109.056,92.0063),(-96.0705,91.4232),(-83.255,90.8563),(-80.7807,90.7498),(-54.1694) ,89.5087),(-41.6419,88.9191),(-32.527,88.7737),(-27.6403,91.0134),(-22.3035,95.141),(-18.0168,100.473),(-15.3918,105.542),(-13.6401, 112.373),(-13.3475、118.988),(-14.4509、125.238),(-17.1246、131.895),(-21.6766、139.821),(-28.5735、149.98),(-33.395、156.344),(-114.702、83.9644) ),(-114.964、87.4599),(-114.328、89.8325),(-112.314、91.6144),(-109.546、92.0209),(-67.9644、90.179),(-55.2013、89.5624),(-34.4271、158.876) ,(-34.6987、161.896),(-33.6055、164.993),(-87.0365、75.9683),(-99.8007、76.0889),(-105.291、76.5448),(-109.558、77.3525),(-112.516、79.2509), (-113.972,81.3335),(2.30014,171.635),(4.40918,169.691),(5.07165,166.974),(5.34843,163.817),(5.30879,161.7 98),(-29.6746、73.5082),(-42.5876、74.0206)]

List = [(-50.6261, 74.3683), (-63.2489, 75.0038), (-76.0384, 75.6219), (-79.8451, 75.7855), (-30.9626, 168.085), (-27.381, 170.967), (-22.9191, 172.928), (-16.5869, 173.087), (-4.813, 172.505), (-109.056, 92.0063), (-96.0705, 91.4232), (-83.255, 90.8563), (-80.7807, 90.7498), (-54.1694, 89.5087), (-41.6419, 88.9191), (-32.527, 88.7737), (-27.6403, 91.0134), (-22.3035, 95.141), (-18.0168, 100.473), (-15.3918, 105.542), (-13.6401, 112.373), (-13.3475, 118.988), (-14.4509, 125.238), (-17.1246, 131.895), (-21.6766, 139.821), (-28.5735, 149.98), (-33.395, 156.344), (-114.702, 83.9644), (-114.964, 87.4599), (-114.328, 89.8325), (-112.314, 91.6144), (-109.546, 92.0209), (-67.9644, 90.179), (-55.2013, 89.5624), (-34.4271, 158.876), (-34.6987, 161.896), (-33.6055, 164.993), (-87.0365, 75.9683), (-99.8007, 76.0889), (-105.291, 76.5448), (-109.558, 77.3525), (-112.516, 79.2509), (-113.972, 81.3335), (2.30014, 171.635), (4.40918, 169.691), (5.07165, 166.974), (5.34843, 163.817), (5.30879, 161.798), (-29.6746, 73.5082), (-42.5876, 74.0206)]

我想对这些点进行排序,以使一条连续的曲线从每个点开始仅经过一次,即从start =(-29.6746,73.5082)开始 和结束=(5.30879,161.798)

I want to sort those points to have a continuous curve passing by every point just once, starting from start = (-29.6746, 73.5082) and end = (5.30879, 161.798)

这是我到目前为止尝试过的:

This is what I tried so far:

import matplotlib.pyplot as plt
import numpy as np
from sklearn.neighbors import NearestNeighbors
import networkx as nx

for el in List:
    X.append(el[0])
    Y.append(el[1])
    x = np.array(X)
    y = np.array(Y)

points = np.c_[x, y]

# find 2 nearest neighbors

clf = NearestNeighbors(2).fit(points)

G = clf.kneighbors_graph()

T = nx.from_scipy_sparse_matrix(G)

# indexes of the new order 

order = list(nx.dfs_preorder_nodes(T, 0))

# sorted arrays 

new_x = x[order]
new_y = y[order]

plt.plot(new_x, new_y)
plt.show()

但是我仍然得到未排序的列表,我找不到确定起点和终点的方法.

But I still get an unsorted list, and I couldn't find a way to determine the start point and end point.

推荐答案

我们可以将该问题视为旅行商问题,可以通过寻找最接近的点来对其进行优化

We can see the problem as a Traveling salesman problem, that we can optimize by looking for the nearest point

def distance(P1, P2):
"""
This function computes the distance between 2 points defined by
 P1 = (x1,y1) and P2 = (x2,y2) 
"""

    return ((P1[0] - P2[0])**2 + (P1[1] - P2[1])**2) ** 0.5


def optimized_path(coords, start=None):
"""
This function finds the nearest point to a point
coords should be a list in this format coords = [ [x1, y1], [x2, y2] , ...] 

"""
    if start is None:
        start = coords[0]
    pass_by = coords
    path = [start]
    pass_by.remove(start)
    while pass_by:
        nearest = min(pass_by, key=lambda x: distance(path[-1], x))
        path.append(nearest)
        pass_by.remove(nearest)
    return path

# define a start point
start = [x0, y0]

path = optimized_path(List,start)

这篇关于使用python对点进行排序以具有连续曲线的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆