Re: [algogeeks] Re: Finding circle areas under dust bins

2011-06-01 Thread Harshal
yes, basically all the groups of intersecting circles centered at each
person should be assigned 1 dustbin. 1 dustbin for 1 such group. I think
this will do.

On Thu, Jun 2, 2011 at 12:05 AM, Don  wrote:

> Assume that the people are more sparse or not uniformly distributed,
> so that you don't need to cover all of the area to cover all of the
> people.
>
> I would think about something like this:
>
> For each pair of two people who are not already within 100 meters of a
> dustbin, but are within 100 meters of each other, consider the two
> locations for a dustbin exactly 100 meters from both of them. Count
> the number of people within 100 meters of each of those locations who
> are not already within 100 meters of a dustbin. Add a dustbin in the
> one location which covers the largest number of new people. Repeat
> until everyone is covered. That is not guaranteed to minimize the
> number of bins, but it should be close.
>
> Don
>
> On May 31, 3:54 pm, Logic King  wrote:
> > If the number of people is large then putting the dustbin in hexagonal
> > fashion as we do in mobile networks should minimize the number of dustbin
> > ...
> >
> > On Tue, May 31, 2011 at 9:35 AM, ross  wrote:
> > > --
> > > You received this message because you are subscribed to the Google
> Groups
> > > "Algorithm Geeks" group.
> > > To post to this group, send email to algogeeks@googlegroups.com.
> > > To unsubscribe from this group, send email to
> > > algogeeks+unsubscr...@googlegroups.com.
> > > For more options, visit this group at
> > >http://groups.google.com/group/algogeeks?hl=en.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>


-- 
Harshal Choudhary,
III Year B.Tech CSE,
NIT Surathkal, Karnataka, India.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



[algogeeks] Re: Finding circle areas under dust bins

2011-06-01 Thread Don
Assume that the people are more sparse or not uniformly distributed,
so that you don't need to cover all of the area to cover all of the
people.

I would think about something like this:

For each pair of two people who are not already within 100 meters of a
dustbin, but are within 100 meters of each other, consider the two
locations for a dustbin exactly 100 meters from both of them. Count
the number of people within 100 meters of each of those locations who
are not already within 100 meters of a dustbin. Add a dustbin in the
one location which covers the largest number of new people. Repeat
until everyone is covered. That is not guaranteed to minimize the
number of bins, but it should be close.

Don

On May 31, 3:54 pm, Logic King  wrote:
> If the number of people is large then putting the dustbin in hexagonal
> fashion as we do in mobile networks should minimize the number of dustbin
> ...
>
> On Tue, May 31, 2011 at 9:35 AM, ross  wrote:
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.