Polynomial Time Algorithms for Bichromatic Problems
Computational Geometry
2016-10-04 v1 Data Structures and Algorithms
Abstract
In this article, we consider a collection of geometric problems involving points colored by two colors (red and blue), referred to as bichromatic problems. The motivation behind studying these problems is two fold; (i) these problems appear naturally and frequently in the fields like Machine learning, Data mining, and so on, and (ii) we are interested in extending the algorithms and techniques for single point set (monochromatic) problems to bichromatic case. For all the problems considered in this paper, we design low polynomial time exact algorithms. These algorithms are based on novel techniques which might be of independent interest.
Cite
@article{arxiv.1610.00300,
title = {Polynomial Time Algorithms for Bichromatic Problems},
author = {Sayan Bandyapadhyay and Aritra Banik},
journal= {arXiv preprint arXiv:1610.00300},
year = {2016}
}