Starting optimizations to graph structure (array to list for vectors)

Author: dorianbrown

.gitignore

@@ -6,6 +6,7 @@ __pycache__/
 # Pycharm
 .idea/
 
+# Img output
 temp/
 
 # C extensions

README.md

@@ -1,9 +1,9 @@
 # Experimenting with generative art
 
-Here I try and create a set of simple rules for which interact to (hopefully) create interesting emergent patterns. 
+Here I try and create a set of simple rules for which interact to (hopefully) create interesting emergent patterns.
 
-<p align="center"> 
-<img src="examples/random_walks_jumps.svg" width="40%">
+<p align="center">
+<img src="examples/20181028-143633-372201-e28dbae-1a67244.png" width="40%">
 </p>
 
 These posts will be heavily inspired by the work of Anders Hoff, which has done some really interesting things in this area. Besides sharing is work and the [code he uses to generate them](https://github.com/inconvergent), he also writes about his process and how he creates what he does on [his website](https://inconvergent.net).
@@ -12,6 +12,6 @@ These posts will be heavily inspired by the work of Anders Hoff, which has done
 
 Although you're free to use anything shared here, beware that this won't be very well maintained. I hope to eventually write a library (which will be maintained) for creating stuff like this, but that's still a ways off.
 
-Using pycairo+gtk3 requires a lot of dependencies outside of python, so I've provided a conda `environment.yml` file. Check [this](https://conda.io/docs/user-guide/tasks/manage-environments.html#sharing-an-environment) out for how to use it. 
+Using pycairo+gtk3 requires a lot of dependencies outside of python, so I've provided a conda `environment.yml` file. Check [this](https://conda.io/docs/user-guide/tasks/manage-environments.html#sharing-an-environment) out for how to use it.
 
 I'm running Ubuntu 18.04, so your mileage on other systems may vary.

draw.py

@@ -6,6 +6,7 @@ class Canvas:
     def __init__(self, width, height, dpi, fname, bg_rgb):
         self.width = width*dpi
         self.height = height*dpi
+        self.dpi = dpi
         self.fname = fname
         self.bg_rgb = bg_rgb
 
@@ -32,7 +33,7 @@ def draw_edge(self, edge, line_width, rgb):
         self.ctx.move_to(*edge[0])
         self.ctx.line_to(*edge[1])
         self.ctx.save()
-        self.ctx.set_line_width(line_width)
+        self.ctx.set_line_width(line_width*self.dpi)
         self.ctx.stroke_preserve()
         self.ctx.fill()
         self.ctx.restore()

examples/20181028-143633-372201-e28dbae-1a67244.png

@@ -22,7 +22,7 @@ def add_edge(self, ind_1, ind_2):
             raise ValueError
         self.edges.add((ind_1, ind_2))
 
-    def closest_vert(self, pos, excluding=[]):
+    def closest_vert_dist(self, pos, excluding=[]):
         dist = np.linalg.norm(self.verts - pos, axis=1)
         dist[excluding] += dist.max() + 1
-        return dist.min(), dist.argmin()
+        return dist.min()

examples/20181028-143633-372201-e28dbae-1a67244.svg

@@ -2,32 +2,33 @@
 
 import cairo as cr
 import numpy as np
+from matplotlib import cm
 
 from objects import DrawGraph
 from rnd import rnd_crc_pnt
 from draw import Canvas
 from fn import Fn
 
 init_vert = [0.5, 0.5]
-edge_length = 0.0025
+edge_length = 0.001
 
 graph = DrawGraph()
 graph.add_vertex(init_vert)
 
 tries = 0
-while graph.verts.shape[0] < 20_000:
-    if graph.verts.shape[0] % 100 == 0 and tries == 0:
+while len(graph.verts) < 150_000:
+    if len(graph.verts) % 100 == 0 and tries == 0:
         print(f"vertices: {len(graph.verts)}")
     tries += 1
-    new_vert = graph.verts[-1] + tries/50*edge_length*rnd_crc_pnt()
+    new_vert = graph.verts[-1] + (1.25 + 0.1*tries)*edge_length*rnd_crc_pnt()
     # Don't draw edge if we wrap-around to other side
     if (new_vert != new_vert % 1).any():
         graph.add_vertex(new_vert % 1)
         continue
-    closest_dist, closest_vert = graph.closest_vert(new_vert)
     # If we have a candidate point far away enough, add it with edge
-    if closest_dist > 1.25*edge_length:
-        if graph.verts.shape[0] % 100 == 0: print(tries)
+    if graph.closest_vert_dist(new_vert) > 1.25*edge_length:
+        if len(graph.verts) % 100 == 0:
+            print(tries)
         tries = 0
         graph.add_vertex(new_vert)
         graph.add_edge(len(graph.verts) - 1, len(graph.verts) - 2)
@@ -48,4 +49,4 @@
     for edge in graph.edges:
         edge_coord = [graph.verts[i] for i in edge]
         if np.linalg.norm(edge_coord[0] - edge_coord[1]) < 2*edge_length:
-            cnv.draw_edge(edge_coord, 5, [0.3, 0.3, 0.3])
+            cnv.draw_edge(edge_coord, 0.01, [0.3, 0.3, 0.3])