The k-center problem is to choose a subset of size k from set n points such that the maximum distance each point its nearest center minimized. Let Q = {Q1, . , Qn} be polygons or segments in region-based uncertainty model, which Qi an uncertain point, where exact locations are unknown. geometric objects as and can models set. We define version generalization objective find cover remaining regio...