RecursiveBezierishCurve: Try it

[moebius3.git] / moebius.py

diff --git a/moebius.py b/moebius.py
index 34111728052e03c6b6dbdcceaf4a88f03d7f0a60..851a8a8029fabbed929648e9089a434fb3af07c9 100644 (file)
--- a/moebius.py
+++ b/moebius.py
@@ -5,6 +5,7 @@ import numpy as np
 from numpy import cos, sin
 
 from bezier import BezierSegment
+from recursivebezier import RecursiveBezierishCurve
 from moenp import *
 
 import sys
@@ -81,7 +82,7 @@ class MoebiusHalf:
     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, constructor=DoubleCubicBezier):
+  def _bezier(m, theta, constructor=RecursiveBezierishCurve):
     cp = [None] * 4
     cp[0] =               m.edge   .point(theta)
     cp[3] =               m.midline.point(theta*2)