[R] circle fill problem

[Robin Hankin]

Mini

This is a hard problem in general.

Recreational mathematics has wrestled with
this and similar problems over the years; the
general field is the "set cover problem" but
in your case the sets are uncountably infinite
(and there are uncountably many of them).

I would be surprised if your problem were not NP complete.


HTH


Robin


On 8 Feb 2007, at 05:15, MINI GHOSH wrote:

> Dear R user,
>
> I want to know is there a way to find the minimum
> number of circles (of given radius) required to fill a
> given area (say rectangular) where overlapping of
> circles is allowed.
>
> Thanks,
> Regards,
> Mini Ghosh
>
> ______________________________________________
> R-help at stat.math.ethz.ch mailing list
> https://stat.ethz.ch/mailman/listinfo/r-help
> PLEASE do read the posting guide http://www.R-project.org/posting- 
> guide.html
> and provide commented, minimal, self-contained, reproducible code.

--
Robin Hankin
Uncertainty Analyst
National Oceanography Centre, Southampton
European Way, Southampton SO14 3ZH, UK
  tel  023-8059-7743