sqrt(b[0] **2 + b[1] ** 2)), a[0] * b[1] - b[0] * a[1], c) for a, b, c in cor_d]
cor_d = sorted([(copysign(acos(min(a, 1)), b), c) for a, b, c in cor_d])
corners = [corners[0]] + [c for _, c in cor_d]
- return (_lines(corners, 0) + [(corners[0], corners[3]),
- (corners[1], corners[2])],
+ return (_lines(corners, 0) +
+ [(corners[0], corners[3]), (corners[1], corners[2])],
_lines(corners[1:4] + [corners[0]], 0) +
[(corners[0], corners[1]), (corners[2], corners[3])])
# TODO what is this?
if n == 0:
x = half_line(corners)
- return (_lines([corners[0], x[0], x[1], corners[3]], n + 1) + [x] +
- _lines([x[0], corners[1], corners[2], x[1]], n + 1))
+ return (_lines([corners[0], x[0], x[1], corners[3]], 1) + [x] +
+ _lines([x[0], corners[1], corners[2], x[1]], 1))
else:
x = half_line(corners)
c = intersection(line(x[0], corners[2]), line(corners[1], corners[3]))