Dtjytyk

Proof of Lemma: Every integer can be written as a product of primes

Golf game boilerplate

Can I use my Chinese passport to enter China after I acquired another citizenship?

How to prevent YouTube from showing already watched videos?

A known event to a history junkie

How do I repair my stair bannister?

Stereotypical names

Should my PhD thesis be submitted under my legal name?

Bob has never been a M before

What do you call the infoboxes with text and sometimes images on the side of a page we find in textbooks?

What is the opposite of 'gravitas'?

Who must act to prevent Brexit on March 29th?

Greatest common substring

Did US corporations pay demonstrators in the German demonstrations against article 13?

Identify a stage play about a VR experience in which participants are encouraged to simulate performing horrific activities

Female=gender counterpart?

Freedom of speech and where it applies

Should a half Jewish man be discouraged from marrying a Jewess?

Giant Toughroad SLR 2 for 200 miles in two days, will it make it?

Java - What do constructor type arguments mean when placed *before* the type?

Can I rely on these GitHub repository files?

Is there a good way to store credentials outside of a password manager?

Can I Retrieve Email Addresses from BCC?

Organic chemistry Iodoform Reaction

Algorithm to arrange different-sized circles in a square area?

How many circles of a given radius can be packed into a given rectangular box?Optimal approximation of square area with identical circlesCovering area algorithm?geometric bin packing with circlesRadius of circle coverage of n circles in square packing configurationWhat is the minimum of squares to fit within rectangular box 10 x 16?Drop $n$ random circles inside a square without overlapIts Swiss Cheese! No wait, just circles in a square… Convexity problemCircle Packing, Estimate only of number of smaller circles in a circle.Optimal Packing of Seven Circles in a Square

0

$begingroup$

Suppose I have a large square and a set of $n$ circles, each with a different radius $r$, such that there exists some way to fit all the circles into the square. Is there an algorithm to find the "best" arrangement of the circles in the square, so that none of the circles overlap and there is the most amount of space possible between them?

(Note that I don't mean a regular circle-packing algorithm, where the circles are all the same size like in the image.)

(PS: sorry if it's unclear, I have a fixed, constant size of the square and a finite set of unequal circles. I'm not trying to minimize anything, just find the best way to arrange these circles without using a brute-force method)

geometry algorithms computer-science packing-problem

share|cite|improve this question

asked Mar 14 at 20:52

user5074736user5074736

112

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  If you want to find the “best” arrangement, that means you’re trying to minimize (or maximize) something. You say you want to arrange the circles so that there is “the most amount of space possible between them” which sounds like you’re maximizing something. How do you define the space between them?
  $endgroup$
  – David M.
  Mar 15 at 8:21
  
  
  

  
  
  
  

add a comment | 

0

$begingroup$

Suppose I have a large square and a set of $n$ circles, each with a different radius $r$, such that there exists some way to fit all the circles into the square. Is there an algorithm to find the "best" arrangement of the circles in the square, so that none of the circles overlap and there is the most amount of space possible between them?

(Note that I don't mean a regular circle-packing algorithm, where the circles are all the same size like in the image.)

(PS: sorry if it's unclear, I have a fixed, constant size of the square and a finite set of unequal circles. I'm not trying to minimize anything, just find the best way to arrange these circles without using a brute-force method)

geometry algorithms computer-science packing-problem

share|cite|improve this question

asked Mar 14 at 20:52

user5074736user5074736

112

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  If you want to find the “best” arrangement, that means you’re trying to minimize (or maximize) something. You say you want to arrange the circles so that there is “the most amount of space possible between them” which sounds like you’re maximizing something. How do you define the space between them?
  $endgroup$
  – David M.
  Mar 15 at 8:21
  
  
  

  
  
  
  

add a comment | 

$begingroup$

Suppose I have a large square and a set of $n$ circles, each with a different radius $r$, such that there exists some way to fit all the circles into the square. Is there an algorithm to find the "best" arrangement of the circles in the square, so that none of the circles overlap and there is the most amount of space possible between them?

(Note that I don't mean a regular circle-packing algorithm, where the circles are all the same size like in the image.)

(PS: sorry if it's unclear, I have a fixed, constant size of the square and a finite set of unequal circles. I'm not trying to minimize anything, just find the best way to arrange these circles without using a brute-force method)

geometry algorithms computer-science packing-problem

share|cite|improve this question

asked Mar 14 at 20:52

user5074736user5074736

112

$endgroup$

share|cite|improve this question

asked Mar 14 at 20:52

user5074736user5074736

112

share|cite|improve this question

asked Mar 14 at 20:52

user5074736user5074736

112

asked Mar 14 at 20:52

user5074736user5074736

112

asked Mar 14 at 20:52

user5074736user5074736

112