[nSLUG] Need an algorithm or heuristic

[Gerald Ruderman]

Oliver,

Good next step for me.

Evan,

Thanks for telling me what it is called. Now I can do some research.

Gerald

On 7/4/15 19:00, Evan Lowry wrote:
> Sounds like a geometric variation of maximum
> coverage: https://en.wikipedia.org/wiki/Maximum_coverage_problem
> 
> Might serve as a starting point.
> 
> On Sat, Jul 4, 2015 at 6:46 PM, Gerald Ruderman <linux at zdoit.airpost.net
> <mailto:linux at zdoit.airpost.net>> wrote:
> 
>     Hi,
> 
>     A little off topic:
> 
>     I need an algorithm or heuristic to solve this problem:
> 
>     There are 200 points in 2 space. Plotted they form approximately an
>     ellipse. I have circles of fixed size whose diameter is about 1/40 of
>     the long dimension of the ellipse and about 1/20 of the smaller axis.  I
>     need to cover all the points in this space with the minimum number of
>     circles. The ideal solution is not required something that is close is
>     needed.
> 
>     I have played around with this for a few weeks and am stumped. If a
>     search were phrased correctly I might find an algorithm to code, but I
>     don't know what to search for.
> 
>     Seeking help either with where to look or a similar problem or a
>     solution.
> 
>     Thanks
> 
>     --
>     Gerald
>     _______________________________________________
>     nSLUG mailing list
>     nSLUG at nslug.ns.ca <mailto:nSLUG at nslug.ns.ca>
>     http://nslug.ns.ca/mailman/listinfo/nslug
> 
> 
> 
> 
> -- 
> Evan Lowry
> www.exitiumonline.com
> <http://www.exitiumonline.com> | https://github.com/Lykathia
> 
> 
> _______________________________________________
> nSLUG mailing list
> nSLUG at nslug.ns.ca
> http://nslug.ns.ca/mailman/listinfo/nslug
>