+def intersections_from_angl_dist(lines, size):
+ intersections = []
+ for (angl1, dist1) in sorted(lines[1], key=itemgetter(1)):
+ line = []
+ for (angl2, dist2) in lines[0]:
+ if abs(angl1 - angl2) > 0.4:
+ x = - ((dist2 / math.cos(angl2))-(dist1 / math.cos(angl1))) / (math.tan(angl1) - math.tan(angl2))
+ y = (math.tan(angl1) * x) - (dist1 / math.cos(angl1))
+ line.append((int(x + size[0] / 2), int(y + size[1] / 2)))
+ intersections.append(line)
+ return intersections
+