[nSLUG] Need an algorithm or heuristic

Oliver Doepner odoepner at gmail.com
Sat Jul 4 19:53:07 ADT 2015


I would start by calculating the distances between adjacent points and
somehow determine where "clusters" are and put circles on the "centres" of
those clusters.



On Sat, Jul 4, 2015 at 6:46 PM, Gerald Ruderman <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
> http://nslug.ns.ca/mailman/listinfo/nslug
>



-- 
Oliver Doepner
http://oliver.doepner.net/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://nslug.ns.ca/pipermail/nslug/attachments/20150704/a9fe15dc/attachment.html>


More information about the nSLUG mailing list