Hi everybody !

so working on this got me to realize a lot of generative type is not open source right now... i would like to create a type face using the DLA sketch from FORM + CODE
http://formandcode.com/code-examples/simulate-dla

having the DLA seed out of the outline of the type's shapes.
using geomerative, i got to this point: 

but i still can't converts those points to seeds for the diffusion to start from ....





i want it to look like this Photoshop mockup i made




my code is looking like:

1. //speed varies when particleCount augments
2. int particleCount = 300000;
3. Particle[] particles = new Particle[particleCount];
4. boolean[] field;
5. import geomerative.*;
6. RFont font;
7. String myText = "Points on Outline";
8. //----------------SETUP---------------------------------
9. void setup() {
10.   size(1024, 700, P2D);
11.   background(102);
12.   smooth();
13.   RG.init(this);
14.   font = new RFont("FreeSans.ttf", 100, CENTER);
15.  fill(255, 0, 0);
16.   noStroke();
17.   translate(width/2, height/2);
18.  
19.  
20.   // create an array that stores the position of our particles
21.   field = new boolean[width * height];
22.  
23.  
24.  //CONFIGURE SEGMENT LENGTH AND MODE
25.   //SETS THE SEGMENT LENGTH BETWEEN TWO POINTS ON A SHAPE/FONT OUTLINE
26.   RCommand.setSegmentLength(10);//ASSIGN A VALUE OF 10, SO EVERY 10 PIXELS
27.   RCommand.setSegmentator(RCommand.UNIFORMLENGTH);
28.  
29.    //RCommand.setSegmentator(RCommand.CUBICBEZIERTO);
30.    //RCommand.setSegmentator(RCommand.ADAPTATIVE);
31.   //GROUP TOGETHER MY FONT & TEXT.
32.   RGroup myGroup = font.toGroup(myText);
33.   myGroup = myGroup.toPolygonGroup();
34.  
35.   //ACCESS POINTS ON MY FONT/SHAPE OUTLINE
36.   RPoint[] myPoints = myGroup.getPoints();
37.   //DRAW ELLIPSES AT EACH OF THESE POINTS
38.   for (int i=0; i<myPoints.length; i++) {
39.     ellipse(myPoints[i].x, myPoints[i].y, 5, 5);
40.   
41.   }
42.  
43.  // add seed in the center
44.  int fcenterX = width / 3 ;
45.  int fcenterY = height / 3;
46.  
47. field[fcenterX + fcenterY * width] = true;
48.  
49.   // make particles
50.   for(int i=0; i<particleCount; i++) {
51.     particles[i] = new Particle();
52.   }
53.  
54.  
55.  
56.  
57.  
58.  
59.  }
60. void draw() {
61.  
62.   loadPixels();
63.   for(int i=0; i<particleCount; i++) {
64.     particles[i].update();
65.     if (particles[i].stuck) {
66.       pixels[particles[i].y * width + particles[i].x] = color(150,255,0);
67.     }
68.   }
69.   updatePixels();
70.  
71.  
72. }

______________________________
and the particle class tab is:

1. // ---------------
2. // Particle.pde
3. // ---------------
4. class Particle
5. {
6.   int x, y;
7.   boolean stuck = false;
8.   Particle() {
9.     reset();
10.   }
11.   void reset() {
12.     // keep choosing random spots until an empty one is found
13.     do {
14.       x = floor(random(width));
15.       y = floor(random(height));
16.     } while (field[y * width + x]);
17.   }
18.   void update() {
19.     // move around
20.     if (!stuck) {
21.       x += round(random(-1, 1));
22.       y += round(random(-1, 1));
23.      
24.       if (x < 0 || y < 0 || x >= width || y >= height) {
25.          reset();
26.          return;
27.       }
28.       // test if something is next to us
29.       if (!alone()) {
30.         stuck = true;
31.         field[y * width + x] = true;       
32.       }
33.     }
34.   }
35.   // returns true if no neighboring pixels
36.   boolean alone() {
37.     int cx = x;
38.     int cy = y;
39.     // get positions
40.     int lx = cx-1;
41.     int rx = cx+1;
42.     int ty = cy-1;
43.     int by = cy+1;
44.     if (cx <= 0 || cx >= width ||
45.     lx <= 0 || lx >= width ||
46.     rx <= 0 || rx >= width ||
47.     cy <= 0 || cy >= height ||
48.     ty <= 0 || ty >= height ||
49.     by <= 0 || by >= height) return true;
50.     // pre multiply the ys
51.     cy *= width;
52.     by *= width;
53.     ty *= width;
54.    
55.     // N, W, E, S
56.     if (field[cx + ty] ||
57.         field[lx + cy] ||
58.         field[rx + cy] ||
59.         field[cx + by]) return false;
60.    
61.     // NW, NE, SW, SE
62.     if (field[lx + ty] ||
63.         field[lx + by] ||
64.         field[rx + ty] ||
65.         field[rx + by]) return false;
66.    
67.    
68.     return true;
69.   } 
70. }

___________________


Anything would help ! thanks so so much !


Youmna