from numpy import cos, sin
from bezier import BezierSegment
+from moenp import *
+from moebez import *
+from curveopt import *
import sys
-tau = np.pi * 2
-
-origin = np.array((0,0,0))
-unit_x = np.array((1,0,0))
-unit_y = np.array((0,1,0))
-unit_z = np.array((0,0,1))
-
class ParametricCircle:
def __init__(pc, c, r0, r1):
''' circle centred on c
return cos(zeta) * r + sin(zeta) * tw._axis
class MoebiusHalf:
- def __init__(m, nu):
+ def __init__(m, nu, nt):
'''
MoebiusHalf().edge is a Twirler for the edge,
expecting theta = u * tau (see MoebiusHalf().point)
m.edge = Twirler(origin, unit_z, unit_x, -2, tau/2)
m.midline = Twirler(-unit_z, unit_z, unit_y, -0.5, 0)
m.nu = nu
+ m.nt = nt
m._thetas = [ u * tau for u in np.linspace(0, 1, nu+1) ]
m._cp2b = BezierSegment([ (c,) for c in [0.33,0.33, 1.50]])
- m._beziers = [ m._bezier(theta) for theta in m._thetas ]
- def _bezier(m, theta):
+ m._dbeziers = [ m._dbezier(theta) for theta in m._thetas ]
+ #check = int(nu/3)-1
+ #checks = (
+ # m._dbezier(m._thetas[check], OptimisedCurve),
+ # m._dbezier(m._thetas[check+1], OptimisedCurve),
+ # m._dbezier(m._thetas[check+2], OptimisedCurve),
+ #)
+ #for c in checks: c.point_at_it(0)
+ def _dbezier(m, theta, dconstructor=OptimisedCurve):
cp = [None] * 4
cp[0] = m.edge .point(theta)
cp[3] = m.midline.point(theta*2)
ncp3 = np.linalg.norm(cp[3])
cpt = ncp3 * ncp3 / 4
cp2scale = m._cp2b.point_at_t(ncp3/2)
- cp1scale = 0.75 * cpt + 0.33 * (1-cpt)
+ cp1scale = 1.0 * cpt + 0.33 * (1-cpt)
#print('u=%d ncp3=%f cp2scale=%f' % (u, ncp3, cp2scale),
# file=sys.stderr)
cp[1] = cp[0] + cp1scale * m.edge .dirn (theta)
cp[2] = cp[3] + cp2scale * m.midline.dirn (theta*2)
- return BezierSegment(cp)
- def point(m, iu, t):
+ return dconstructor(cp, m.nt)
+ def point(m, iu, it):
'''
0 <= iu <= nu meaning 0 <= u <= 1
along the extent (well, along the edge)
0 and 1 are both the top half of the flat traverse
0.5 is the bottom half of the flat traverse
- 0 <= t <= 1 across the half-traverse
+ 0 <= it <= nt across the half-traverse
0 is the edge, 1 is the midline
'''
- return np.array(m._beziers[iu].point_at_t(t))
+ return np.array(m._dbeziers[iu].point_at_it(it))
- def point_offset(m, iu, t, offset):
+ def details(m, iu, t):
'''
- offset by offset perpendicular to the surface
- at the top (iu=t=0), in the y direction
+ returns tuple of 4 vectors:
+ - point location
+ - normal (+ve is in the +ve y direction at iu=t=0) unit vector
+ - along extent (towrds +ve iu) unit vector
+ - along traverse (towards +ve t) unit vector
'''
- p = MoebiusHalf.point(m, iu, t)
+ if iu == m.nu:
+ return m.details(0, t)
+ p = m.point(iu, t)
+ vec_t = unit_v( m.point(iu, t + 0.01) - p )
if t == 0:
- dirn = m.edge.dirn(m._thetas[iu], extra_zeta=-tau/4)
- elif iu == m.nu:
- return MoebiusHalf.point_offset(m, 0, t, offset)
+ normal = m.edge.dirn(m._thetas[iu], extra_zeta=-tau/4)
+ vec_u = np.cross(vec_t, normal)
else:
- vec_t = MoebiusHalf.point(m, iu, t + 0.01) - p
- vec_u = MoebiusHalf.point(m, iu+1, t) - p
- dirn = np.cross(vec_u, vec_t)
- return p + offset * dirn / np.linalg.norm(dirn)
+ vec_u = unit_v( m.point(iu+1, t) - p )
+ normal = np.cross(vec_u, vec_t)
+ return p, normal, vec_u, vec_t
+
+ def point_offset(m, iu, t, offset):
+ '''
+ offset by offset perpendicular to the surface
+ at the top (iu=t=0), +ve offset is in the +ve y direction
+ '''
+ p, normal, dummy, dummy = m.details(iu, t)
+ return p + offset * normal
-class Moebius(MoebiusHalf):
+class Moebius():
def __init__(m, nv, nw):
'''
0 <= v <= nw along the extent, v=0 is the flat traverse
m.nv = nv
m.nw = nw
m.nt = nw/2
- m._t_vals = np.linspace(0, 1, m.nt+1)
- MoebiusHalf.__init__(m, nu=nv*2)
+ m.h = MoebiusHalf(nu=nv*2, nt=m.nt)
def _vw2tiu_kw(m, v, w):
if w <= m.nt:
iu = m.nv + v
#print('v,w=%d,%d => it,iu=%d,%d' % (v,w,it,iu),
# file=sys.stderr)
- return { 't': m._t_vals[it], 'iu': iu }
+ return { 'it': it, 'iu': iu }
def point(m, v, w):
- return MoebiusHalf.point(m, **m._vw2tiu_kw(v,w))
+ return m.h.point(**m._vw2tiu_kw(v,w))
def point_offset(m, v, w, offset):
- return MoebiusHalf.point_offset(m,
- offset=
- offset if w <= m.nt else -offset,
- **m._vw2tiu_kw(v,w))
+ return m.h.point_offset(offset=
+ offset if w <= m.nt else -offset,
+ **m._vw2tiu_kw(v,w))
+
+ def details(m, v, w):
+ '''
+ returns tuple of 4 vectors:
+ - point location
+ - normal (+ve is in the +ve y direction at iu=t=0) unit vector
+ - along extent (towrds +ve v) unit vector
+ - along traverse (towards +ve w) unit vector
+ '''
+ p, normal, vec_v, vec_w = m.h.details(**m._vw2tiu_kw(v,w))
+ if w > m.nt:
+ normal = -normal
+ vec_w = -vec_w
+ return p, normal, vec_v, vec_w