Systems of distant representatives in euclidean space

Authors:
Adrian Dumitrescu;Minghui Jiang
Affiliations:
Univ. of Wisconsin-Milwaukee, Milwaukee, WI, USA;Utah State University, Logan, Logan, UT, USA
Venue:
Proceedings of the twenty-ninth annual symposium on Computational geometry
Year:
2013

Citing 9
Cited 1

The problem of compatible representatives

SIAM Journal on Discrete Mathematics
Matchings and extensions

Handbook of combinatorics (vol. 1)
Approximation algorithms for spreading points

Journal of Algorithms
Hall's theorem for hypergraphs

Journal of Graph Theory
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition
Systems of distant representatives

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On Covering Problems of Rado

Algorithmica - Special Issue: Scandinavian Workshop on Algorithm Theory; Guest Editor: Joachim Gudmundsson
Note: Constrained k-center and movement to independence

Discrete Applied Mathematics
Dispersion in Disks

Theory of Computing Systems - Theoretical Aspects of Computer Science

Computational geometry column 56

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a finite family of sets, Hall's classical marriage theorem provides a necessary and sufficient condition for the existence of a system of distinct representatives for the sets in the family. Here we extend this result to a geometric setting: given a finite family of objects in the Euclidean space eg, convex bodies, we highlight a sufficient condition for the existence of a system of distinct representatives for the objects that are also distant from each other. For a wide variety of geometric objects, this sufficient condition is also necessary in an asymptotic sense ie, apart from constant factors, the inequalities are best possible. Our methods are constructive and lead to efficient algorithms for computing such representatives.