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