packing circles in rectangle grasshopper

#Packing circles in rectangle grasshopper code

if this circle does not fit in the rectangle, BAIL this functions attempts to build a circle If the box fills up before the desired number of circles are created, the radius is reduced and it all starts over again. If it doesn't fit, the line will swing 360 degrees, checking for open spaces. If the new circle fits, another line will be extended from the new circle.

If that circle fits, it extends a diameter line from that circle and tries to create a circle at the end of the line. It then tries to fit one circle in the corner of the box. The program starts by calculating a large radius based on the box dimensions. Every circle will always be touching another circle.The first option yields a rectangle with perimeter 18 and. If you pack them in square formation, you can make 6 rows of 3, or 9 rows of 2. For instance, suppose you need to pack 18 cans in a rectangular box. One circle will always be in the corner. (Assume that the circles have a diameter of 1.) Hexagonal Packing Arrangements.The program is now called via the wrapped function.

#Packing circles in rectangle grasshopper code

This is code golf, so shortest program (as of ) wins. Just to make this reasonable and do-able, all numbers must be precise to the 2nd decimal place. If any circle overlaps or does not fit entirely inside of the box, your submission is invalid. You can use command line arguments, user input, hard coded variables, or anything else you want. Tessellations of regular polygons correspond to particular circle packings (Williams 1979, pp. The generalization to spheres is called a sphere packing. This program must run with any size of rectangle, and any number of circles and still get a valid answer. A circle packing is an arrangement of circles inside a given boundary such that no two overlap and some (or all) of them are mutually tangent. Lastly, it should create and save a picture with these circles drawn. the number of circles colors correspond to active researchers in the past, see 'References' at the bottom of the page radius of the circles in the rectangle ratio 0.2/radius density ratio of total area occupied by the circles to container area (for an infinite hexagonal packing you get the well-known value Pi/(2sqrt(3))0. (Obviously, you must replace some_number with the radius your program calculates, N with the number of circles you end up using, and x and y with the actual coordinates of the circle) Your program should then print this to the console: Highest possible radius: All of the circles fit inside of the rectangle.(similar to this wikipedia article) Your program must find the largest possible radius and optimal position of these N circles so that Your task is to write a program that finds the largest radius that N circles can have and still fit inside of a rectangle that is X by Y pixels large.