2 from __future__ import print_function
5 from numpy import cos, sin
10 from moedebug import *
13 from math import atan2, atan, sqrt
17 findcurve_subproc = None
19 class HelixishCurve():
25 dp = unit_v(cp[1]-cp[0])
26 dq = unit_v(cp[3]-cp[2])
28 dbg('HelixishCurve __init__', cp)
35 # - solve in the plane containing dP and dQ
36 # - total distance normal to that plane gives mu
37 # - now resulting curve is not parallel to dP at P
38 # nor dQ at Q, so tilt it
39 # - [[ pick as the hinge point the half of the curve
40 # with the larger s or t ]] not yet implemented
41 # - increase the other distance {t,s} by a bodge factor
42 # approx distance between {Q,P} and {Q,P}' due to hinging
43 # but minimum is 10% of (wlog) {s,t} [[ not quite like this ]]
45 dPQplane_normal = np.cross(dp, dq)
47 if np.linalg.norm(dPQplane_normal) < 1E-6:
48 dbg('dPQplane_normal small')
49 dPQplane_normal = np.cross([1,0,0], dp)
50 if np.linalg.norm(dPQplane_normal) < 1E-6:
51 dbg('dPQplane_normal small again')
52 dPQplane_normal = np.cross([0,1,0], dp)
54 dPQplane_normal = unit_v(dPQplane_normal)
56 vdbg().arrow([0,0,0], dPQplane_normal, color=(1,1,0))
58 dPQplane_basis = np.column_stack((np.cross(dp, dPQplane_normal),
63 dPQplane_basis = np.vstack((dPQplane_basis, [0,0,0,1]))
66 vdbg().basis(dPQplane_basis)
68 dPQplane_into = np.linalg.inv(dPQplane_basis)
71 p_plane_check = augmatmultiply(dPQplane_into, p)
72 dp_plane = augmatmultiply(dPQplane_into, dp, augwith=0)
73 dq_plane = augmatmultiply(dPQplane_into, dq, augwith=0)
74 q_plane = augmatmultiply(dPQplane_into, q)
75 dist_pq_plane = np.linalg.norm(q_plane[0:2])
77 vdbg_plane = MatrixVisdebug(vdbg(), dPQplane_basis)
79 dbg('plane p', p_plane_check, 'dp', dp_plane, 'dq', dq_plane,
80 'q', q_plane, 'dist_pq_plane', dist_pq_plane)
81 vdbg_plane.arrow(p_plane_check, dp_plane)
82 vdbg_plane.arrow(q_plane, dq_plane)
84 railway_inplane_basis_x = np.hstack((q_plane[0:2], [0]))
85 railway_inplane_basis = np.column_stack((
86 railway_inplane_basis_x,
87 -np.cross([0,0,1], railway_inplane_basis_x),
91 #dbg('railway_inplane_basis\n', railway_inplane_basis)
92 railway_inplane_basis = np.vstack((railway_inplane_basis,
94 dbg('railway_inplane_basis\n', railway_inplane_basis)
95 railway_basis = matmatmultiply(dPQplane_basis, railway_inplane_basis)
96 dbg('railway_basis\n', railway_basis)
97 vdbg().basis(railway_basis, hue=(1,0,1))
98 vdbg_railway = MatrixVisdebug(vdbg(), railway_basis)
100 # two circular arcs of equal maximum possible radius
101 # algorithm courtesy of Simon Tatham (`Railway problem',
102 # pers.comm. to ijackson@chiark 23.1.2004)
103 railway_angleoffset = atan2(*q_plane[0:2])
104 # these two angles are unconventional: clockwise from north
105 railway_theta = tau/4 - (atan2(*dp_plane[0:2]) - railway_angleoffset)
106 railway_phi = tau/4 - (atan2(*-dq_plane[0:2]) - railway_angleoffset)
107 railway_cos_theta = cos(railway_theta)
108 railway_cos_phi = cos(railway_phi)
110 dbg('railway:', railway_theta, railway_phi, railway_angleoffset)
112 def vdbg_railway_angle(start, angle, **kw):
113 vdbg_railway.arrow(start, [sin(angle), cos(angle), 0], **kw)
114 vdbg_railway_angle([0, 0, 0.1], railway_theta, color=(1, 0.5, 0))
115 vdbg_railway_angle([1, 0, 0.1], railway_phi, color=(1, 0.5, 0))
116 vdbg_railway_angle([1, 0, 0.1], 0, color=(1, 1.00, 0))
117 vdbg_railway_angle([1, 0, 0.1], tau/4, color=(1, 0.75, 0))
119 if railway_cos_theta**2 + railway_cos_phi**2 > 1E-6:
120 railway_polynomial = [
121 2 * (1 + cos(railway_theta - railway_phi)),
122 2 * (railway_cos_theta - railway_cos_phi),
125 railway_roots = np.roots(railway_polynomial)
126 dbg('railway poly, roots:', railway_polynomial, railway_roots)
128 #vdbg_railway.circle([0,0,0], [0,0, dist_pq_plane], color=(.5,0,0))
129 #vdbg_railway.circle([1,0,0], [0,0, 0.05], color=(.5,0,0))
130 #vdbg().circle(p, dPQplane_normal * dist_pq_plane, color=(.5,.5,0))
132 for railway_r_pq1 in railway_roots:
133 # roots for r are calculated based on coordinates where
134 # Q is at (1,0) but our PQ distance is different
135 railway_r = railway_r_pq1 * dist_pq_plane
136 dbg(' twoarcs root r_pq1=', railway_r_pq1, 'r=',railway_r,
137 railway_polynomial[0] * railway_r_pq1 * railway_r_pq1 +
138 railway_polynomial[1] * railway_r_pq1 +
139 railway_polynomial[2]
142 vdbg_railway.circle([0,0,0], [0,0, railway_r], color=(1,0,0))
143 #vdbg().circle(p, dPQplane_normal * railway_r, color=(1,1,0))
145 def railway_CPQ(pq, dpq, railway_r):
146 CPQ = pq + railway_r * np.array([-dpq[1], dpq[0]])
147 dbg('railway_CPQ', railway_r, pq, dpq, CPQ)
148 vdbg_plane.circle( np.hstack((CPQ, [0])),
151 #vdbg_plane.circle( np.hstack(( 2*np.asarray(pq) - CPQ, [0])),
153 # color = (.5,.5,.5) )
156 railway_CP = railway_CPQ([0,0], dp_plane, railway_r)
157 railway_QP = railway_CPQ(q_plane[0:2], -dq_plane, railway_r)
158 railway_midpt = 0.5 * (railway_CP + railway_QP)
161 def railway_ST(C, start, end, railway_r):
162 delta = atan2(*(end - C)[0:2]) - atan2(*(start - C)[0:2])
163 dbg('railway_ST C', C, 'start', start, 'end', end, 'delta', delta)
164 s = delta * railway_r
165 dbg('railway_ST delta', delta, 'r', railway_r, 's', s)
168 try_s = railway_ST(railway_CP, [0,0], railway_midpt, railway_r)
169 try_t = railway_ST(railway_CP, railway_midpt, q_plane[0:2], railway_r)
170 dbg('try_s, _t', try_s, try_t)
171 if try_s < 0 or try_t < 0:
174 try_st = try_s + try_t
175 if best_st is None or try_st < best_st:
176 start_la = 1/railway_r
180 start_mu = q_plane[2] / (start_s + start_t)
183 else: # twoarcs algorithm is not well defined
186 start_s = dist_pq_plane * .65
187 start_t = dist_pq_plane * .35
190 bodge = max( q_plane[2] * start_mu,
191 (start_s + start_t) * 0.1 )
192 start_s += 0.5 * bodge
193 start_t += 0.5 * bodge
197 tilt = atan(start_mu)
198 tilt_basis = np.array([
200 [ 0, cos(tilt), sin(tilt), 0 ],
201 [ 0, -sin(tilt), cos(tilt), 0 ],
204 findcurve_basis = matmatmultiply(dPQplane_basis, tilt_basis)
205 findcurve_into = np.linalg.inv(findcurve_basis)
207 for ax in range(0,3):
208 vdbg().arrow(findcurve_basis[0:3,3], findcurve_basis[0:3,ax])
210 q_findcurve = augmatmultiply(findcurve_into, q)
211 dq_findcurve = augmatmultiply(findcurve_into, dq, augwith=0)
213 findcurve_target = np.hstack((q_findcurve, dq_findcurve))
214 findcurve_start = (sqrt(start_s), sqrt(start_t), start_la,
215 start_mu, start_gamma, start_kappa)
217 findcurve_epsilon = dist_pq_plane * 0.01
219 global findcurve_subproc
220 if findcurve_subproc is None:
221 dbg('STARTING FINDCURVE')
222 findcurve_subproc = subprocess.Popen(
225 stdin=subprocess.PIPE,
226 stdout=subprocess.PIPE,
229 # restore_signals=True, // want python2 compat, nnng
230 universal_newlines=True,
233 findcurve_input = np.hstack((findcurve_target,
235 [findcurve_epsilon]))
237 def dbg_fmt_params(fcp):
238 return (('s=%10.7f t=%10.7f sh=%10.7f'
239 +' st=%10.7f la=%10.7f mu=%10.7f ga=%10.7f ka=%10.7f')
241 (( fcp[0]**2, fcp[1]**2 ) + tuple(fcp)))
243 #dbg('>> ' + ' '.join(map(str,findcurve_input)))
245 dbg(('RUNNING FINDCURVE' +
247 ' target Q=[%10.7f %10.7f %10.7f] dQ=[%10.7f %10.7f %10.7f]')
249 tuple(findcurve_input[0:6]))
250 dbg(('%s initial') % dbg_fmt_params(findcurve_input[6:12]))
252 print(*findcurve_input, file=findcurve_subproc.stdin)
253 findcurve_subproc.stdin.flush()
255 hc.func = symbolic.get_python()
259 l = findcurve_subproc.stdout.readline()
262 if not l: vdbg().crashing('findcurve EOF')
263 if not l.startswith('['):
271 dbg(('%s Q=[%10.7f %10.7f %10.7f] dQ=[%10.7f %10.7f %10.7f]%s')
273 (( dbg_fmt_params(l[0:6]), ) + tuple(l[6:12]) + (commentary,) ))
276 hc.findcurve_result = l[0:6]
277 hc.threshold = l[0]**2
278 hc.total_dist = hc.threshold + l[1]**2
279 #vdbg().curve( hc.point_at_t )
281 def point_at_t(hc, normalised_parameter):
282 dist = normalised_parameter * hc.total_dist
283 ours = list(hc.findcurve_result)
284 if dist <= hc.threshold:
288 ours[1] = sqrt(dist - hc.threshold)
289 asmat = hc.func(*ours)