Journal of Algorithms
Separating convex sets in the plane
Discrete & Computational Geometry
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
Concept learning with geometric hypotheses
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Journal of Computer and System Sciences
Sequential and parallel algorithms for finding a maximum convex polygon
Computational Geometry: Theory and Applications
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Geometric discrepancy theory and uniform distribution
Handbook of discrete and computational geometry
Programming pearls: algorithm design techniques
Communications of the ACM
Low-Dimensional Linear Programming with Violations
SIAM Journal on Computing
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Bichromatic separability with two boxes: A general approach
Journal of Algorithms
On the range maximum-sum segment query problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Covering a bichromatic point set with two disjoint monochromatic disks
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Let R be a set of red points and B a set of blue points on the plane. In this paper we introduce a new concept, which we call coarseness, for measuring how blended the elements of S=R@?B are. For X@?S, let @?(X)=||X@?R|-|X@?B|| be the bichromatic discrepancy of X. We say that a partition @P={S"1,S"2,...,S"k} of S is convex if the convex hulls of its members are pairwise disjoint. The discrepancy of a convex partition @P of S is the minimum @?(S"i) over the elements of @P. The coarseness of S is the discrepancy of the convex partition of S with maximum discrepancy. We study the coarseness of bicolored point sets, and relate it to well blended point sets. In particular, we show combinatorial results on the coarseness of general configurations and give efficient algorithms for computing the coarseness of two specific cases, namely when the set of points is in convex position and when the measure is restricted to convex partitions with two elements.