我试图找到两个矩形(或多边形)之间的最近距离。
我有以下代码:
def hypotenuse(point1,point2):
'''
gives you the length of a line between two
points
'''
x1, y1, z1 = point1
x2, y2, z2 = point2
x_distance = abs(x2 - x1)
y_distance = abs(y2 - y1)
hypotenuse_length = ((x_distance**2) + (y_distance**2))**.5
return hypotenuse_length
def shortest_distance_between_point_lists(lst_a, lst_b):
'''
Tells you the shortest distance (clearance) between two
sets of points. Assumes objects are not overlapping.
'''
lst_dicts =([dict(zip(('lst_a','lst_b'), (i,j))) for i,j\
in itertools.product(lst_a,lst_b)])
shortest_hypotenuse = 1000000000
for a_dict in lst_dicts:
point1 = a_dict.get('lst_a')
point2 = a_dict.get('lst_b')
current_hypotenuse = hypotenuse(point1,point2)
if (current_hypotenuse < shortest_hypotenuse):
shortest_hypotenuse = current_hypotenuse
shortest_dict = a_dict
return shortest_hypotenuse
这段代码有效,但它并不漂亮,运行时间太长。任何优化建议?
答案 0 :(得分:0)
你首先将你的观点放入字典并随后将它们删除,这样你就会非常复杂。您可以将此简化为此类(未经测试):
shortest = min(hypotenuse(p1, p2) for p1, p2 in itertools.product(lst_a, lst_b))
这会从itertools.product
的输出中创建generator expression,您可以将其直接提供给min
。