patterning circles with attractor point (limited to certain sizes)

Hi all,

I've learnt how to pattern circles with attractor points, but I don't like how they overlap as they grow bigger.. What I would like to achieve is to restrict the growth of the circles into perhaps only 5 different sizes like the picture below to avoid overlapping. Can anyone help me out on this?

Thanks!

Replies to This Discussion

Permalink Reply by Pieter Segeren on April 13, 2011 at 8:49am

Hi Ruby, you could use the Min component.
For the steps you could use an if statement.

Permalink Reply by Pieter Segeren on April 13, 2011 at 1:12pm

Well that was easier said than done... :| Sorry about that.
I felt like I needed to get back to this, so I gave it a try. It's not how I was picturing to make this, but it works, so I thought I'd let you know anyway.
I hope someone will jump in to get you a cleaner definition.

Attachments:

Halftonish.ghx, 422 KB

Permalink Reply by Ruby on April 13, 2011 at 9:09pm

Hi Pieter, thank you so much for your attempt. I think the definition works perfectly fine! It is indeed a little too complex for a beginner like me, but I'll play around with it to get some idea..

Thank you again, Cheers!

Permalink Reply by Beltrán Fernández Mariño on April 15, 2011 at 5:30am

Classify circles by distance in order to set properties by class:

1 Distances (N points from grid, N distances).

2 & 3 Sort descendently, reverse and retrieve the first item:

maximum.

4 A bunch of sliders (L) in [0, 1], ReMap to get values in

[0, max].

4 - 5 k values in [0, max] set the boundaries of (k - 1) domains.

6 & 7 Test belongness of every distance (point) to every domain

(interval of distances): classify distances (points).

Every branch (7) is a class (interval of distances) so radius or colour or whatever can be set by branch (by class).

Distance (1) belongs to [0, max]. Domains (5) should be a partition —classes— covering [0, max], but a partition covering a subinterval of [0, max] is set if the first and last L sliders —boundaries— aren't 0 and 1: nearest and furthest circles will be culled.

Keeping radii under half Cell Size, circles won't overlap.

Attachments:

ClassifyByDistance_Bel.ghx, 275 KB
ClassifyByDistance_Bel.3dm, 59 KB

Permalink Reply by Beltrán Fernández Mariño on April 18, 2011 at 7:11am

Hi Ruby,

Have you had any problems with my previous post? Useful?

Permalink Reply by Ruby on April 20, 2011 at 3:02am

Hi Beltran,

THis is great stuff! No problem with the script at all.. Thank you!

Permalink Reply by Beltrán Fernández Mariño on April 20, 2011 at 2:50pm

Permalink Reply by Ola Jaensson on April 15, 2011 at 6:24am

Hi,

If you don't need specific radii, just some rounding steps and a max.

/Ola Jaensson

Permalink Reply by Beltrán Fernández Mariño on April 18, 2011 at 4:19pm

Hi Ola,

I first though about quantization but I assumed that she needed specific radii. Or that she would prefer more complex (interesting, powerful, didactic, &c.) examples. But sometimes simpler is clever :]

Permalink Reply by Alyne Rankin on August 19, 2015 at 9:03pm

Beltrán Fernández Mariño

I'm having trouble rebuilding the definition for this and the source file does not open in the current version of GH.can you reply with the current definition. thank you for posting.

Permalink Reply by Benni Amerongen on August 27, 2015 at 4:37am