Distant Representatives for Rectangles in the Plane
Computational Geometry
2021-08-18 v1
Abstract
The input to the distant representatives problem is a set of objects in the plane and the goal is to find a representative point from each object while maximizing the distance between the closest pair of points. When the objects are axis-aligned rectangles, we give polynomial time constant-factor approximation algorithms for the , , and distance measures. We also prove lower bounds on the approximation factors that can be achieved in polynomial time (unless P = NP).
Cite
@article{arxiv.2108.07751,
title = {Distant Representatives for Rectangles in the Plane},
author = {Therese Biedl and Anna Lubiw and Anurag Murty Naredla and Peter Dominik Ralbovsky and Graeme Stroud},
journal= {arXiv preprint arXiv:2108.07751},
year = {2021}
}
Comments
Full-length version of a paper to appear at ESA'21