Geometric Systems of Unbiased Representatives

02/13/2020
by   Aritra Banik, et al.
0

Let P be a set of points in ℝ^d, B a bicoloring of P and a family of geometric objects (that is, intervals, boxes, balls, etc). An object from is called balanced with respect to B if it contains the same number of points from each color of B. For a collection of bicolorings of P, a geometric system of unbiased representatives (G-SUR) is a subset '⊆ such that for any bicoloring B of there is an object in ' that is balanced with respect to B. We study the problem of finding G-SURs. We obtain general bounds on the size of G-SURs consisting of intervals, size-restricted intervals, axis-parallel boxes and Euclidean balls. We show that the G-SUR problem is NP-hard even in the simple case of points on a line and interval ranges. Furthermore, we study a related problem on determining the size of the largest and smallest balanced intervals for points on the real line with a random distribution and coloring. Our results are a natural extension to a geometric context of the work initiated by Balachandran et al. on arbitrary systems of unbiased representatives.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/11/2018

Coloring Delaunay-Edges and their Generalizations

We consider geometric graphs whose vertex set is a finite set of points ...
research
08/21/2017

Balanced partitions of 3-colored geometric sets in the plane

Let S be a finite set of geometric objects partitioned into classes or c...
research
04/03/2020

Geodesic Spanners for Points in ℝ^3 amid Axis-parallel Boxes

Let P be a set of n points in ℝ^3 amid a bounded number of obstacles. Wh...
research
07/28/2022

Colorful Helly Theorem for Piercing Boxes with Two Points

Let h(d,2) denote the smallest integer such that any finite collection o...
research
12/24/2017

Largest and Smallest Area Triangles on a Given Set of Imprecise Points

In this paper we study the following problem: we are given a set of impr...
research
12/18/2017

Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading

We consider dynamic loading and unloading problems for heavy geometric o...
research
05/13/2019

Color spanning Localized query

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

Please sign up or login with your details

Forgot password? Click here to reset