Login / Signup
Efficient algorithm for placing a given number of base stations to cover a convex region.
Gautam K. Das
Sandip Das
Subhas C. Nandy
Bhabani P. Sinha
Published in:
J. Parallel Distributed Comput. (2006)
Keyphrases
</>
computational complexity
learning algorithm
region of interest
memory requirements
space complexity
k means
np hard
convex hull
globally optimal
image segmentation
segmentation algorithm
base station