chiark / gitweb /
helixish: debugging output
authorIan Jackson <ijackson@chiark.greenend.org.uk>
Sat, 30 Dec 2017 12:24:59 +0000 (12:24 +0000)
committerIan Jackson <ijackson@chiark.greenend.org.uk>
Sat, 30 Dec 2017 12:24:59 +0000 (12:24 +0000)
Signed-off-by: Ian Jackson <ijackson@chiark.greenend.org.uk>
helixish.py

index 2bfa494d462ba60e7f0382d2c56906a2579f1beb..88769c364f5fbbeafcd3d4098e07eba8f1c034d3 100644 (file)
@@ -94,6 +94,7 @@ class HelixishCurve():
     railway_basis = matmatmultiply(dPQplane_basis, railway_inplane_basis)
     dbg('railway_basis\n', railway_basis)
     vdbg().basis(railway_basis, hue=(1,0,1))
+    vdbg_railway = MatrixVisdebug(vdbg(), railway_basis)
 
     # two circular arcs of equal maximum possible radius
     # algorithm courtesy of Simon Tatham (`Railway problem',
@@ -106,6 +107,11 @@ class HelixishCurve():
 
     dbg('railway:', railway_theta, railway_phi, railway_angleoffset)
 
+    def vdbg_railway_plane_angle(start, angle, **kw):
+      vdbg_railway.arrow(start, [sin(angle), cos(angle), 0], **kw)
+    vdbg_railway_plane_angle([0,0,0], railway_theta, color=(1, 0.5, 0))
+    vdbg_railway_plane_angle([1,0,0], railway_phi,   color=(1, 0.5, 0))
+
     if railway_cos_theta**2 + railway_cos_phi**2 > 1E-6:
       railway_roots = np.roots([
         2 * (1 + cos(railway_theta - railway_phi)),