Closing this shape that is using perlin noise.

Programming Questions

thunderba..

Closing this shape that is using perlin noise.

in Programming Questions • 1 year ago

Hello,

I am close to my desired program, however I would like the shape to close.

Can someone point me in the right direction?

Thanks!

float radius = 200;
float z;
void setup () {
size(500,400);
background(255);
smooth();
noStroke();
fill(0);
}
void draw () {
background(255);
pushMatrix();
translate(width/2,height/2);
for (int i = 0; i < 360; i++) {
float n1 = noise((i)*0.01, z*0.00001)*radius;
float x = sin(radians(i))*n1;
float y = cos(radians(i))*n1;
ellipse(x,y,2,2);
z++;
}
popMatrix();
}

Replies(4)

calsign

Re: Closing this shape that is using perlin noise.

1 year ago

There was a post not too long ago involving exactly this topic... I think amnon.owed answered it, but that's all I know... I can't find it, either...

tfguy44

Re: Closing this shape that is using perlin noise.

1 year ago

There is a simple way to close it, but it still doesn't look quite right...

float radius = 200;
float x,y,z;
float[] n;
void setup () {
size(500,400);
background(255);
smooth();
noStroke();
fill(0);
n = new float[360];
}
void draw () {
background(255);
pushMatrix();
translate(width/2,height/2);
for (int i = 0; i < 360; i++) {
n[i] = noise((i)*0.01, z*0.00001)*radius;
z++;
}
float diff = n[0] - n[359];
for (int i = 0; i < 360; i++) {
// x = sin(radians(i))*n[i];
// y = cos(radians(i))*n[i];
// ellipse(x,y,2,2);
x = sin(radians(i))*(n[i]+lerp(0,diff,i/360.0));
y = cos(radians(i))*(n[i]+lerp(0,diff,i/360.0));
ellipse(x,y,2,2);
}
popMatrix();
}

PhiLho

Re: Closing this shape that is using perlin noise.

1 year ago

calsign, for searches, Zoho sucks (particularly if your search a Processing keyword!), use the search from Processing.org (provided by Google!).
I searched noise loop and just found it back: https://forum.processing.org/topic/how-to-make-perlin-noise-loop as first hit.

thunderba..

Re: Closing this shape that is using perlin noise.

1 year ago

Thanks!

Top Reply