3 papers
math.CO2019
On Colourability of Polygon Visibility Graphs
Onur Çağirici, Petr Hliněný, Bodhayan Roy
We study the problem of colouring visibility graphs of polygons. In particular, for visibility graphs of simple polygons, we provide a polynomial algorithm for 4-colouring, and pro…
cs.CG2017
Expanding Visibility Polygons by Mirrors upto at least K units
Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi +1
We consider extending visibility polygon of a given point , inside a simple polygon by converting some edges of to mirrors. We will show that several va…
cs.CG2016
Partitions of planar point sets into polygons
Ajit Arvind Diwan, Bodhayan Roy
In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partitio…