helixish: better debug

Signed-off-by: Ian Jackson <ijackson@chiark.greenend.org.uk>

diff --git a/helixish.py b/helixish.py
index 14df4619a60242d46b262201d7b3e165933742b2..19c592bbeaf1b4cece7195d2fee5aa27fa351e91 100644 (file)
--- a/helixish.py
+++ b/helixish.py
@@ -73,16 +73,20 @@ class HelixishCurve():
                                       dp,
                                       dPQplane_normal,
                                       p));
-    dbg(dPQplane_basis)
-    dPQplane_basis = np.vstack((dPQplane_basis, [0,0,0,1]))
     #dbg(dPQplane_basis)
+    dPQplane_basis = np.vstack((dPQplane_basis, [0,0,0,1]))
+    dbg(dPQplane_basis)
     dPQplane_into = np.linalg.inv(dPQplane_basis)
+    dbg(dPQplane_into)
 
+    p_plane_check = augmatmultiply(dPQplane_into, p)
     dp_plane = augmatmultiply(dPQplane_into, dp, augwith=0)
     dq_plane = augmatmultiply(dPQplane_into, dq, augwith=0)
     q_plane  = augmatmultiply(dPQplane_into, q)
     dist_pq_plane = np.linalg.norm(q_plane)
 
+    dbg('plane:', p_plane_check, dp_plane, dq_plane, q_plane)
+
     # two circular arcs of equal maximum possible radius
     # algorithm courtesy of Simon Tatham (`Railway problem',
     # pers.comm. to ijackson@chiark 23.1.2004)