Question to the floor!
Is there a way to procedurally create a map of circles that don't overlap? See handy sketch for The Ultimate Function to grab a segment of the map:
How would you approach creating this? Ideally supporting a large number of circles, say 1,000,000 or so.
put a point, with the help of "line"
randomly increase the point
randomly move point
grab the required area
Make 10 Random Tiles with Cargues and a Transparent Background
Randomly arrange tiles with overlapping each other 10-20 pixels
ps/ English is not my language
мій блог по гідерос https://simartinfo.blogspot.com
Fragmenter - animated loop machine and IKONOMIKON - the memory game
I like the Box2D variant. Probably won't work with too many circles though. Ideally I'd like to avoid a two dimensional array, because it would take time to process and create. I'd like to solve it with perlin noise or another formula which is infinite. But I'm probably dreaming!
Maybe the best thing to do is to create the map offline, then just save the coordinates and radiuses of each circle. Then load that massive file on startup.
The beauty of a perlin noise solution would be that no pre-generation would be needed and the map of circles would in theory be infinite.
If you want to allow things to be a bit closer than rectangle bounds you can query the rectangle and check for circle overlaps between any items returned by the query. Here is a messy example that may or may not work (untested but you should get the gist of it)