Resumen de Unit disk visibility graphs
Deniz Ağaoğlu Çağırıcı, Onur Çağırıcı
We study unit disk visibility graphs, where the visibility relation between a pair ofgeometric entities is defined by not only obstacles, but also the distance between them.This particular graph class models real world scenarios more accurately compared to theconventional visibility graphs. We first define and classify the unit disk visibility graphs,and then show that the 3-coloring problem is NP-complete when unit disk visibility modelis used for a set of line segments (which applies to a set of points) even when every segmentis axis-parallel (i.e., parallel to either x- or y-axis) or when every segment has unit length(i.e., 1-unit long), and for a polygon with holes.
