CONVEXhull coverage
Posted: Tue Apr 26, 2005 5:24 pm
Is there any algorithm for a given convex hull and given radius(r), how many minimal point(with radious r) is needed for cover the whole area?
Like the mobile network, how many tower is needed for a particular area
if each tower cover r distance?
Like the mobile network, how many tower is needed for a particular area
if each tower cover r distance?