# Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model

The k-center problem is to choose a subset of size k from a set of n points such that the maximum distance from each point to its nearest center is minimized. Let Q={Q_1,…,Q_n} be a set of polygons or segments in the region-based uncertainty model, in which each Q_i is an uncertain point, where the exact locations of the points in Q_i are unknown. The geometric objects segments and polygons can be models of a point set. We define the uncertain version of the k-center problem as a generalization in which the objective is to find k points from Q to cover the remaining regions of Q with minimum or maximum radius of the cluster to cover at least one or all exact instances of each Q_i, respectively. We modify the region-based model to allow multiple points to be chosen from a region and call the resulting model the aggregated uncertainty model. All these problems contain the point version as a special case, so they are all NP-hard with a lower bound 1.822. We give approximation algorithms for uncertain k-center of a set of segments and polygons. We also have implemented some of our algorithms on a data-set to show our theoretical performance guarantees can be achieved in practice.

• 11 publications
• 12 publications
• 14 publications
• 21 publications
research
03/16/2021

### Uncertain Curve Simplification

We study the problem of polygonal curve simplification under uncertainty...
research
04/24/2020

### Fréchet Distance for Uncertain Curves

In this paper we study a wide range of variants for computing the (discr...
research
10/25/2017

### The Geodesic 2-center Problem in a Simple Polygon

The geodesic k-center problem in a simple polygon with n vertices consis...
research
08/30/2017

### Improvements on the k-center problem for uncertain data

In real applications, there are situations where we need to model some p...
research
04/20/2023

### Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities

In this paper, we study the problems of computing the 1-center, centroid...
research
10/02/2019

### Optimal Patrolling of High Priority Segments While Visiting the Unit Interval with a Set of Mobile Robots

Consider a region that requires to be protected from unauthorized penetr...
research
08/23/2019

### A Center in Your Neighborhood: Fairness in Facility Location

When selecting locations for a set of facilities, standard clustering al...