3 papers
cs.CG2016
Polynomial Time Algorithms for Bichromatic Problems
Sayan Bandyapadhyay, Aritra Banik
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 st…
cs.CG2015
Discrete Voronoi Games and -Nets, in Two and Three Dimensions
Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari +1
The one-round discrete Voronoi game, with respect to a -point user set , consists of two players Player 1 () and Player 2 (). At first, $\mathca…
cs.DS2014
Voronoi Game on Graphs
Sayan Bandyapadhyay, Aritra Banik, Sandip Das +1
\textit{Voronoi game} is a geometric model of competitive facility location problem played between two players. Users are generally modeled as points uniformly distributed on a giv…