X-Git-Url: http://git.tomasm.cz/imago.git/blobdiff_plain/b1b5232a3561e92a40a26ff586ee3496b080692c..e38a85551b486a0e1691eba67a9c8cfad528dbf1:/manual.py

diff --git a/manual.py b/manual.py
index 55dfdd0..e60a848 100644
--- a/manual.py
+++ b/manual.py
@@ -2,7 +2,7 @@
 
 import pygame
 import Image, ImageDraw
-from math import atan, sin, cos, pi
+from math import atan, sin, cos, pi, sqrt, acos, copysign
 
 class UserQuitError(Exception):
     pass
@@ -65,15 +65,19 @@ def find_lines(im_orig):
                             for j in [3, 9, 15]:
                                 hoshi(intersection(line(l_vert[i][0], l_vert[i][1]),
                                                    line(l_hor[j][0], l_hor[j][1])))
-                        lines_r = [[l2ad(l[0], l[1], im.size) for l in l_vert], 
-                                   [l2ad(l[0], l[1], im.size) for l in l_hor]]
+                        lines_r = [[l2ad(l, im.size) for l in l_vert], 
+                                   [l2ad(l, im.size) for l in l_hor]]
 
         screen.display_picture(im)
         clock.tick(15)
 
 def lines(corners):
-    cor_d = sorted([(corners[0][0] * c[1] - c[0] * corners[0][1], c) for c in
-                    corners[1:]])
+    #TODO Error on triangle 
+    cor_d = [(corners[0], (c[0] - corners[0][0], c[1] - corners[0][1]), c) for c in
+             corners[1:]]
+    cor_d = [(float(a[0] * b[0] + a[1] * b[1]) / (sqrt(a[0] ** 2 + a[1] ** 2) *
+              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(a), 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])],
@@ -89,8 +93,14 @@ def _lines(corners, n):
         x = half_line(corners)
         c = intersection(line(x[0], corners[2]), line(corners[1], corners[3]))
         d = intersection(line(corners[0], corners[3]), line(corners[1], corners[2]))
-        l = (intersection(line(corners[0], corners[1]), line(c,d)),
-             intersection(line(corners[2], corners[3]), line(c,d)))
+        if d:
+            l = (intersection(line(corners[0], corners[1]), line(c,d)),
+                 intersection(line(corners[2], corners[3]), line(c,d)))
+        else:
+            lx = line(c, (c[0] + corners[0][0] - corners[3][0], 
+                      c[1] + corners[0][1] - corners[3][1]))
+            l = (intersection(line(corners[0], corners[1]), lx),
+                 intersection(line(corners[2], corners[3]), lx))
         l2 = half_line([corners[0], l[0], l[1], corners[3]])
         if n == 1:
             return ([l, l2] + _lines([l[0], l2[0], l2[1], l[1]], 2)
@@ -129,7 +139,7 @@ def intersection(p, q):
     return (int(round(float(q[1] * p[2] - p[1] * q[2]) / det)), 
             int(round(float(p[0] * q[2] - q[0] * p[2]) / det)))
 
-def l2ad(a, b, size):
+def l2ad((a, b), size):
     if (a[0] - b[0]) == 0:
         angle = pi / 2
     else: