Dispersing Points on Intervals
Computational Geometry
2016-11-30 v1
Abstract
We consider a problem of dispersing points on disjoint intervals on a line. Given n pairwise disjoint intervals sorted on a line, we want to find a point in each interval such that the minimum pairwise distance of these points is maximized. Based on a greedy strategy, we present a linear time algorithm for the problem. Further, we also solve in linear time the cycle version of the problem where the intervals are given on a cycle.
Cite
@article{arxiv.1611.09485,
title = {Dispersing Points on Intervals},
author = {Shimin Li and Haitao Wang},
journal= {arXiv preprint arXiv:1611.09485},
year = {2016}
}
Comments
A preliminary version to appear in ISAAC 2016