DeepAI AI Chat
Log In Sign Up

Minimum color spanning circle of imprecise points

by   Ankush Acharyya, et al.
Czech Technical University in Prague
Akademie věd ČR
Utrecht University

Let R be a set of n colored imprecise points, where each point is colored by one of k colors. Each imprecise point is specified by a unit disk in which the point lies. We study the problem of computing the smallest and the largest possible minimum color spanning circle, among all possible choices of points inside their corresponding disks. We present an O(nklog n) time algorithm to compute a smallest minimum color spanning circle. Regarding the largest minimum color spanning circle, we show that the problem is NP-Hard and present a 1/3-factor approximation algorithm. We improve the approximation factor to 1/2 for the case where no two disks of distinct color intersect.


page 1

page 2

page 3

page 4


On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model

Given a set of n points P in the plane, each colored with one of the t g...

Color spanning Localized query

Let P be a set of n points and each of the points is colored with one of...

On the minimum spanning tree problem in imprecise set-up

In this article, we study the Euclidean minimum spanning tree problem in...

A 4-Approximation of the 2π/3-MST

Bounded-angle (minimum) spanning trees were first introduced in the cont...

The Rectilinear Steiner Forest Arborescence problem

Let r be a point in the first quadrant Q_1 of the plane ℝ^2 and let P ⊂ ...

Largest and Smallest Area Triangles on Imprecise Points

Assume we are given a set of parallel line segments in the plane, and we...

Geometric Multicut

We study the following separation problem: Given a collection of colored...