3 citations · 9 across the 15 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CG2016
On colouring point visibility graphs
Ajit Arvind Diwan, Bodhayan Roy
In this paper we show that it can be decided in polynomial time whether or not the visibility graph of a given point set is 4-colourable, and such a 4-colouring, if it exists, can…
cs.CG2016★ 2 cited
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…