Made a branching example... sort of

cage.py

@@ -43,7 +43,21 @@ class Cage(object):
                 yield self.verts[n0:n1,:]
             else:
                 yield self.verts[n0:,:]
-            
+    def subdivide_deprecated(self):
+        # assume self.verts has shape (4,3).
+        # Midpoints of every segment:
+        mids = (self.verts + numpy.roll(self.verts, 1, axis=0)) / 2
+        mids_adj = numpy.roll(mids, -1, axis=0)
+        # Centroid:
+        centroid = numpy.mean(self.verts, axis=0)
+        # Now, every single new boundary has: one vertex of 'bound', an
+        # adjacent midpoint, a centroid, and the other adjacent midpoint.
+        cages = [
+            Cage(numpy.array([self.verts[i,:], mids[i,:], centroid, mids_adj[i,:]]),
+                 self.splits)
+            for i in range(4)
+        ]
+        return cages
     def is_fork(self):
         return False
     def transform(self, xform):
@@ -69,7 +83,7 @@ class CageGen(object):
         self.gen = gen
     def to_mesh(self, count=None, flip_order=False, loop=False, close_first=False,
                 close_last=False, join_fn=meshutil.join_boundary_simple):
-        print("to_mesh(count={})".format(count))
+        #print("to_mesh(count={})".format(count))
         # Get 'opening' polygons of generator:
         cage_first = next(self.gen)
         # TODO: Avoid 'next' here so that we can use a list, not solely a

examples.py

@@ -151,20 +151,34 @@ def ram_horn_branch():
                    .scale(0.9) \
                    .rotate([-1,0,1], 0.3) \
                    .translate(0,0,0.8)
-    def recur(xf, count):
+    def recur(xf, cage0, count):
         for i in range(count):
-            cage2 = cage1.transform(xf)
-            yield cage2
+            yield cage0.transform(xf)
             xf0 = xf
             xf = incr.compose(xf)
-        gens = [cage.CageGen(recur(xf0.compose(opening_boundary(i)), 64)) for i in range(4)]
-        # TODO: Above is wrong, but I'm not sure what's right.
-        # No, it's not post-composing either.
+        # .compose(opening_boundary(i))
+        def xf_sub(i):
+            # yes, I can do this in a one-liner
+            if i == 0:
+                dx, dy = 0.25, 0.25
+            elif i == 1:
+                dx, dy = -0.25, 0.25
+            elif i == 2:
+                dx, dy = -0.25, -0.25
+            elif i == 3:
+                dx, dy = 0.25, -0.25
+            return meshutil.Transform() \
+                           .translate(dx, dy, 0) \
+                           .rotate([0,0,1], i*numpy.pi/2) \
+                           .translate(-dx, -dy, 0)
+        gens = [cage.CageGen(recur(xf_sub(i).compose(xf0), cage_sub, 8))
+                for i,cage_sub in
+                enumerate(cage0.subdivide_deprecated())]
         yield cage.CageFork(gens)
-    gens = [cage.CageGen(recur(opening_boundary(i), 64)) for i in range(4)]
+    gens = [cage.CageGen(recur(opening_boundary(i), cage1, 8)) for i in range(4)]
     cg = cage.CageGen(itertools.chain([cage0, cage1, cage.CageFork(gens)]))
     # TODO: if this is just a list it seems silly to require itertools
-    mesh = cg.to_mesh(count=128, close_first=True, close_last=True)
+    mesh = cg.to_mesh(count=32, close_first=True, close_last=True)
     return mesh
 
 def branch_test():