5
$\begingroup$

I have question related to circle-packing. The problem is to find the circle of minimum radius enclosing four non-overlapping circles of arbitrary radius. I have to write a program in C for this question but have not been able to find a formula for the radius of the enclosing circle. Any help appreciated.

For more understanding see this link

  • 0
    This question is not clear.2012-03-09
  • 0
    Question is just find the minimum radius of Circle circumscribing four circle of unequal radius. Please see this [link](http://www.palgrave-journals.com/jors/journal/v62/n11/fig_tab/jors2010157f2.html#figure-title) for figure and some solution...But required a short approach/formula...2012-03-09
  • 0
    @jaywendt..Plz help me..2012-03-09
  • 0
    Regarding your "test cases": how can even one circle of radius 2500 be contained in a circle of radius 1837? I looked at the link you posted. To make sense of your question I think the radius of the enclosed circles would have to be smaller.2012-03-09
  • 0
    @daniel..Yes ur right..Test case are wrongly posted...2012-03-09
  • 0
    @Avinash: in that case the question is probably clear enough without the examples.2012-03-09
  • 0
    @daniel..Plz give me some solution to solve such problem..except that I posted...2012-03-09
  • 0
    @daniel..I do now..2012-03-09
  • 0
    @daniel..I want some simple approach to do the same..different from Paper..Because paper has solution for n circle and in my case only four. So, if I get some alternate solution based on some single hit formula then it great help for me...2012-03-09
  • 0
    @Avinash: now I think the problem is clear, and the link in your comment connects to a paper which actually does answer your question. It's a nontrivial optimization problem which is set out pretty clearly in the first set of equations in that paper. Perhaps someone with expertise in that area will address your question.2012-03-09
  • 0
    Waiting for someone to help.......2012-03-09

1 Answers 1